Sivaraman Balakrishnan
Sivaraman Balakrishnan
Adresă de e-mail confirmată pe stat.cmu.edu - Pagina de pornire
Citat de
Citat de
Optimal kernel choice for large-scale two-sample tests
A Gretton, D Sejdinovic, H Strathmann, S Balakrishnan, M Pontil, ...
Advances in neural information processing systems 25, 2012
Statistical guarantees for the EM algorithm: From population to sample-based analysis
S Balakrishnan, MJ Wainwright, B Yu
Learning generative models for protein fold families
S Balakrishnan, H Kamisetty, JG Carbonell, SI Lee, CJ Langmead
Proteins: Structure, Function, and Bioinformatics 79 (4), 1061-1078, 2011
Confidence sets for persistence diagrams
BT Fasy, F Lecci, A Rinaldo, L Wasserman, S Balakrishnan, A Singh
Robust estimation via robust gradient estimation
A Prasad, AS Suggala, S Balakrishnan, P Ravikumar
Journal of the Royal Statistical Society Series B: Statistical Methodology …, 2020
Estimation from pairwise comparisons: Sharp minimax bounds with topology dependence
NB Shah, S Balakrishnan, J Bradley, A Parekh, K Ramch, MJ Wainwright
Journal of Machine Learning Research 17 (58), 1-47, 2016
Local maxima in the likelihood of gaussian mixture models: Structural results and algorithmic consequences
C Jin, Y Zhang, S Balakrishnan, MJ Wainwright, MI Jordan
Advances in neural information processing systems 29, 2016
Stochastically transitive models for pairwise comparisons: Statistical and computational issues
N Shah, S Balakrishnan, A Guntuboyina, M Wainwright
International Conference on Machine Learning, 11-20, 2016
Universal inference
L Wasserman, A Ramdas, S Balakrishnan
Proceedings of the National Academy of Sciences 117 (29), 16880-16890, 2020
Computationally efficient robust sparse estimation in high dimensions
S Balakrishnan, SS Du, J Li, A Singh
Conference on Learning Theory, 169-212, 2017
A unified view of label shift estimation
S Garg, Y Wu, S Balakrishnan, Z Lipton
Advances in Neural Information Processing Systems 33, 3290-3300, 2020
Stochastic zeroth-order optimization in high dimensions
Y Wang, S Du, S Balakrishnan, A Singh
International conference on artificial intelligence and statistics, 1356-1365, 2018
Leveraging unlabeled data to predict out-of-distribution performance
S Garg, S Balakrishnan, ZC Lipton, B Neyshabur, H Sedghi
arXiv preprint arXiv:2201.04234, 2022
Noise thresholds for spectral clustering
S Balakrishnan, M Xu, A Krishnamurthy, A Singh
Advances in Neural Information Processing Systems, 954-962, 2011
Efficient active algorithms for hierarchical clustering
A Krishnamurthy, S Balakrishnan, M Xu, A Singh
arXiv preprint arXiv:1206.4672, 2012
How many samples are needed to estimate a convolutional neural network?
SS Du, Y Wang, X Zhai, S Balakrishnan, RR Salakhutdinov, A Singh
Advances in Neural Information Processing Systems 31, 2018
Sharp instruments for classifying compliers and generalizing causal effects
EH Kennedy, S Balakrishnan, M G’sell
Plugin estimation of smooth optimal transport maps
T Manole, S Balakrishnan, J Niles-Weed, L Wasserman
arXiv preprint arXiv:2107.12364, 2021
A permutation-based model for crowd labeling: Optimal estimation and robustness
NB Shah, S Balakrishnan, MJ Wainwright
IEEE Transactions on Information Theory 67 (6), 4162-4184, 2020
Robust multivariate nonparametric tests via projection averaging
I Kim, S Balakrishnan, L Wasserman
The Annals of Statistics 48 (6), 3417-3441, 2020
Sistemul nu poate realiza operația în acest moment. Încercați din nou mai târziu.
Articole 1–20