default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDAkshay Balsubramani
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[i19]Akshay Balsubramani:
Entropy, concentration, and learning: a statistical mechanics primer. CoRR abs/2409.18630 (2024)- 2022
- [j1]Jacob M. Schreiber
, Surag Nair, Akshay Balsubramani, Anshul Kundaje:
Accelerating in silico saturation mutagenesis using compressed sensing. Bioinform. 38(14): 3557-3564 (2022) - 2021
- [c11]Pang Wei Koh, Shiori Sagawa, Henrik Marklund, Sang Michael Xie, Marvin Zhang, Akshay Balsubramani, Weihua Hu, Michihiro Yasunaga, Richard Lanas Phillips, Irena Gao, Tony Lee, Etienne David, Ian Stavness, Wei Guo, Berton Earnshaw, Imran S. Haque, Sara M. Beery, Jure Leskovec, Anshul Kundaje, Emma Pierson, Sergey Levine, Chelsea Finn, Percy Liang:
WILDS: A Benchmark of in-the-Wild Distribution Shifts. ICML 2021: 5637-5664 - 2020
- [c10]Ruishan Liu, Akshay Balsubramani, James Zou:
Learning transport cost from subset correspondence. ICLR 2020 - [i18]Akshay Balsubramani:
Sharp finite-sample large deviation bounds for independent variables. CoRR abs/2008.13293 (2020) - [i17]Pang Wei Koh, Shiori Sagawa, Henrik Marklund, Sang Michael Xie, Marvin Zhang, Akshay Balsubramani, Weihua Hu, Michihiro Yasunaga, Richard Lanas Phillips, Sara Beery, Jure Leskovec, Anshul Kundaje, Emma Pierson, Sergey Levine, Chelsea Finn, Percy Liang:
WILDS: A Benchmark of in-the-Wild Distribution Shifts. CoRR abs/2012.07421 (2020)
2010 – 2019
- 2019
- [c9]Akshay Balsubramani, Sanjoy Dasgupta, Yoav Freund, Shay Moran:
An adaptive nearest neighbor rule for classification. NeurIPS 2019: 7577-7586 - [i16]Akshay Balsubramani, Sanjoy Dasgupta, Yoav Freund, Shay Moran:
An adaptive nearest neighbor rule for classification. CoRR abs/1905.12717 (2019) - [i15]Ruishan Liu, Akshay Balsubramani, James Zou:
Learning transport cost from subset correspondence. CoRR abs/1909.13203 (2019) - 2018
- [c8]Chris Donahue, Zachary C. Lipton, Akshay Balsubramani, Julian J. McAuley:
Semantically Decomposing the Latent Spaces of Generative Adversarial Networks. ICLR (Poster) 2018 - 2017
- [c7]Akshay Balsubramani:
Optimal Binary Autoencoding with Pairwise Correlations. ICLR (Poster) 2017 - [i14]Chris Donahue, Akshay Balsubramani, Julian J. McAuley, Zachary C. Lipton:
Semantically Decomposing the Latent Spaces of Generative Adversarial Networks. CoRR abs/1705.07904 (2017) - [i13]Akshay Balsubramani:
Linking Generative Adversarial Learning and Binary Classification. CoRR abs/1709.01509 (2017) - 2016
- [b1]Akshay Balsubramani:
Playing Games to Reduce Supervision in Learning. University of California, San Diego, USA, 2016 - [c6]Akshay Balsubramani, Zohar S. Karnin, Robert E. Schapire, Masrour Zoghi:
Instance-dependent Regret Bounds for Dueling Bandits. COLT 2016: 336-360 - [c5]Akshay Balsubramani, Yoav Freund:
Optimal Binary Classifier Aggregation for General Losses. NIPS 2016: 5033-5040 - [c4]Akshay Balsubramani, Aaditya Ramdas:
Sequential Nonparametric Testing with the Law of the Iterated Logarithm. UAI 2016 - [i12]Akshay Balsubramani:
Learning to Abstain from Binary Prediction. CoRR abs/1602.08151 (2016) - [i11]Akshay Balsubramani, Yoav Freund:
Muffled Semi-Supervised Learning. CoRR abs/1605.08833 (2016) - [i10]Akshay Balsubramani:
Optimal Binary Autoencoding with Pairwise Correlations. CoRR abs/1611.02268 (2016) - 2015
- [c3]Akshay Balsubramani, Yoav Freund:
Optimally Combining Classifiers Using Unlabeled Data. COLT 2015: 211-225 - [c2]Akshay Balsubramani, Yoav Freund:
Scalable Semi-Supervised Aggregation of Classifiers. NIPS 2015: 1351-1359 - [i9]Akshay Balsubramani, Sanjoy Dasgupta, Yoav Freund:
The Fast Convergence of Incremental PCA. CoRR abs/1501.03796 (2015) - [i8]Akshay Balsubramani, Yoav Freund:
PAC-Bayes with Minimax for Confidence-Rated Transduction. CoRR abs/1501.03838 (2015) - [i7]Akshay Balsubramani, Yoav Freund:
Optimally Combining Classifiers Using Unlabeled Data. CoRR abs/1503.01811 (2015) - [i6]Aaditya Ramdas, Akshay Balsubramani:
Sequential Nonparametric Testing with the Law of the Iterated Logarithm. CoRR abs/1506.03486 (2015) - [i5]Akshay Balsubramani, Yoav Freund:
Scalable Semi-Supervised Classifier Aggregation. CoRR abs/1506.05790 (2015) - [i4]Akshay Balsubramani:
PAC-Bayes Iterated Logarithm Bounds for Martingale Mixtures. CoRR abs/1506.06573 (2015) - [i3]Akshay Balsubramani, Yoav Freund:
Minimax Binary Classifier Aggregation with General Losses. CoRR abs/1510.00452 (2015) - [i2]Akshay Balsubramani:
The Utility of Abstaining in Binary Classification. CoRR abs/1512.08133 (2015) - 2014
- [i1]Akshay Balsubramani:
Sharp Uniform Martingale Concentration Bounds. CoRR abs/1405.2639 (2014) - 2013
- [c1]Akshay Balsubramani, Sanjoy Dasgupta, Yoav Freund:
The Fast Convergence of Incremental PCA. NIPS 2013: 3174-3182
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-10-18 19:33 CEST 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:
