Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDVikas K. Garg
Person information
- affiliation: MIT
- affiliation: Toyota Technological Institute at Chicago
- affiliation: IBM Research - India
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
[c32]Timur Garipov, Sebastiaan De Peuter, Ge Yang, Vikas K. Garg, Samuel Kaski, Tommi S. Jaakkola:
Compositional Sculpting of Iterative Generative Processes. NeurIPS 2023- [i15]Timur Garipov, Sebastiaan De Peuter, Ge Yang, Vikas K. Garg, Samuel Kaski, Tommi S. Jaakkola:
Compositional Sculpting of Iterative Generative Processes. CoRR abs/2309.16115 (2023) - 2022
- [c31]David Alvarez-Melis, Vikas K. Garg, Adam Kalai:
Are GANs overkill for NLP? NeurIPS 2022 - [c30]Amauri H. Souza, Diego Mesquita, Samuel Kaski, Vikas K. Garg:
Provably expressive temporal graph networks. NeurIPS 2022 - [c29]Yogesh Verma, Samuel Kaski, Markus Heinonen, Vikas K. Garg:
Modular Flows: Differential Molecular Generation. NeurIPS 2022 - [i14]David Alvarez-Melis, Vikas K. Garg, Adam Tauman Kalai:
Why GANs are overkill for NLP. CoRR abs/2205.09838 (2022) - [i13]Amauri H. Souza, Diego Mesquita, Samuel Kaski, Vikas K. Garg:
Provably expressive temporal graph networks. CoRR abs/2209.15059 (2022) - [i12]Yogesh Verma, Samuel Kaski, Markus Heinonen, Vikas K. Garg:
Modular Flows: Differential Molecular Generation. CoRR abs/2210.06032 (2022) - 2021
- [c28]Vikas K. Garg, Adam Tauman Kalai, Katrina Ligett, Zhiwei Steven Wu:
Learn to Expect the Unexpected: Probably Approximately Correct Domain Generalization. AISTATS 2021: 3574-3582 - 2020
- [c27]Vikas K. Garg, Tommi S. Jaakkola:
Predicting deliberative outcomes. ICML 2020: 3408-3418 - [c26]Vikas K. Garg, Stefanie Jegelka, Tommi S. Jaakkola:
Generalization and Representational Limits of Graph Neural Networks. ICML 2020: 3419-3430 - [i11]Vikas K. Garg, Adam Kalai, Katrina Ligett, Zhiwei Steven Wu:
Learn to Expect the Unexpected: Probably Approximately Correct Domain Generalization. CoRR abs/2002.05660 (2020) - [i10]Vikas K. Garg, Stefanie Jegelka, Tommi S. Jaakkola:
Generalization and Representational Limits of Graph Neural Networks. CoRR abs/2002.06157 (2020)
2010 – 2019
- 2019
- [c25]John Ingraham, Vikas K. Garg, Regina Barzilay, Tommi S. Jaakkola:
Generative Models for Graph-Based Protein Design. DGS@ICLR 2019 - [c24]Vikas K. Garg, Tamar Pichkhadze:
Online Markov Decoding: Lower Bounds and Near-Optimal Approximation Algorithms. NeurIPS 2019: 5681-5691 - [c23]Vikas K. Garg, Tommi S. Jaakkola:
Solving graph compression via optimal transport. NeurIPS 2019: 8012-8023 - [c22]John Ingraham, Vikas K. Garg, Regina Barzilay, Tommi S. Jaakkola:
Generative Models for Graph-Based Protein Design. NeurIPS 2019: 15794-15805 - [i9]Vikas K. Garg, Tommi S. Jaakkola:
Solving graph compression via optimal transport. CoRR abs/1905.12158 (2019) - [i8]Vikas K. Garg, Tommi S. Jaakkola:
Strategic Prediction with Latent Aggregative Games. CoRR abs/1905.12169 (2019) - [i7]Vikas K. Garg, Inderjit S. Dhillon, Hsiang-Fu Yu:
Multiresolution Transformer Networks: Recurrence is Not Essential for Modeling Hierarchical Structure. CoRR abs/1908.10408 (2019) - 2018
- [c21]Vikas K. Garg:
Supervising Unsupervised Learning. NeurIPS 2018: 4996-5006 - [c20]Vikas K. Garg, Ofer Dekel, Lin Xiao:
Learning SMaLL Predictors. NeurIPS 2018: 9143-9153 - [c19]Vikas K. Garg, Lin Xiao, Ofer Dekel:
Sparse Multi-Prototype Classification. UAI 2018: 704-714 - [i6]Vikas K. Garg, Ofer Dekel, Lin Xiao:
Learning SMaLL Predictors. CoRR abs/1803.02388 (2018) - [i5]Vikas K. Garg, Tamar Pichkhadze:
Peek Search: Near-Optimal Online Markov Decoding. CoRR abs/1810.07301 (2018) - 2017
- [c18]Vikas K. Garg, Tommi S. Jaakkola:
Local Aggregative Games. NIPS 2017: 5341-5351 - [i4]Vikas K. Garg, Adam Kalai:
Supervising Unsupervised Learning. CoRR abs/1709.05262 (2017) - 2016
- [c17]Vikas K. Garg, Cynthia Rudin, Tommi S. Jaakkola:
CRAFT: ClusteR-specific Assorted Feature selecTion. AISTATS 2016: 305-313 - [c16]Vikas K. Garg, Tommi S. Jaakkola:
Learning Tree Structured Potential Games. NIPS 2016: 1552-1560 - [i3]Vikas K. Garg, Adam Tauman Kalai:
Meta-Unsupervised-Learning: A supervised approach to unsupervised learning. CoRR abs/1612.09030 (2016) - 2015
- [c15]Sukrit Shankar, Vikas K. Garg, Roberto Cipolla
:
DEEP-CARVING: Discovering visual attributes by carving deep neural nets. CVPR 2015: 3403-3412 - [i2]Sukrit Shankar, Vikas K. Garg, Roberto Cipolla:
DEEP-CARVING: Discovering Visual Attributes by Carving Deep Neural Nets. CoRR abs/1504.04871 (2015) - [i1]Vikas K. Garg, Cynthia Rudin, Tommi S. Jaakkola:
CRAFT: ClusteR-specific Assorted Feature selecTion. CoRR abs/1506.07609 (2015) - 2014
- [c14]Risi Kondor, Nedelina Teneva, Vikas K. Garg:
Multiresolution Matrix Factorization. ICML 2014: 1620-1628 - 2013
- [j2]Vikas K. Garg, Y. Narahari, M. Narasimha Murty:
Novel Biobjective Clustering (BiGC) Based on Cooperative Game Theory. IEEE Trans. Knowl. Data Eng. 25(5): 1070-1082 (2013) - [c13]Vikas K. Garg, T. S. Jayram, Balakrishnan Narayanaswamy:
Online Optimization with Dynamic Temporal Uncertainty: Incorporating Short Term Predictions for Renewable Integration in Intelligent Energy Systems. AAAI 2013: 1291-1297 - [c12]Vikas K. Garg, Sneha Chaudhari, Ankur Narang:
Multi-regularization for Fuzzy Co-clustering. ICONIP (2) 2013: 67-75 - [c11]Priyanka Agrawal, Vikas K. Garg, Ramasuri Narayanam:
Link Label Prediction in Signed Social Networks. IJCAI 2013: 2591-2597 - [c10]Samory Kpotufe, Vikas K. Garg:
Adaptivity to Local Smoothness and Dimension in Kernel Regression. NIPS 2013: 3075-3083 - 2012
- [c9]Balakrishnan Narayanaswamy, Vikas K. Garg, T. S. Jayram:
Online optimization for the smart (micro) grid. e-Energy 2012: 19 - [c8]Balakrishnan Narayanaswamy, Vikas K. Garg, T. S. Jayram:
Prediction based storage management in the smart grid. SmartGridComm 2012: 498-503 - 2011
- [c7]Souvik Bhattacherjee, Ankur Narang, Vikas K. Garg:
High throughput data redundancy removal algorithm with scalable performance. HiPEAC 2011: 87-96 - 2010
- [c6]Vikas K. Garg, Ankur Narang, Souvik Bhattacherjee:
Real-time memory efficient data redundancy removal algorithm. CIKM 2010: 1259-1268 - [c5]Ankur Narang, Raj Gupta, Anupam Joshi, Vikas K. Garg:
Highly scalable parallel collaborative filtering algorithm. HiPC 2010: 1-10 - [c4]Vikas K. Garg, Nukala Viswanadham:
EcoSupply: A Machine Learning Framework for Analyzing the Impact of Ecosystem on Global Supply Chain Dynamics. SEAL 2010: 677-686 - [c3]Vikas K. Garg, M. Narasimha Murty:
EPIC: Efficient Integration of Partitional Clustering Algorithms for Classification. SEAL 2010: 706-710 - [c2]Vikas K. Garg:
Toward Optimal Disk Layout of Genome Scale Suffix Trees. SEAL 2010: 711-715
2000 – 2009
- 2009
- [j1]Vikas K. Garg, M. Narasimha Murty:
Feature subspace SVMs (FS-SVMs) for high dimensional handwritten digit recognition. Int. J. Data Min. Model. Manag. 1(4): 411-436 (2009) - [c1]Vikas K. Garg, M. Narasimha Murty:
RACK: RApid clustering using K-means algorithm. CASE 2009: 621-626
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-03-03 00:05 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
