Sledovat
Sivaraman Balakrishnan
Sivaraman Balakrishnan
Carnegie Mellon University
E-mailová adresa ověřena na: stat.cmu.edu - Domovská stránka
Název
Citace
Citace
Rok
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
6122012
Statistical guarantees for the EM algorithm: From population to sample-based analysis
S Balakrishnan, MJ Wainwright, B Yu
4892017
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
3472011
Confidence sets for persistence diagrams
BT Fasy, F Lecci, A Rinaldo, L Wasserman, S Balakrishnan, A Singh
The Annals of Statistics, 2301-2339, 2014
328*2014
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
2072020
Estimation from pairwise comparisons: Sharp minimax bounds with topology dependence
N Shah, S Balakrishnan, J Bradley, A Parekh, K Ramchandran, ...
Artificial intelligence and statistics, 856-865, 2015
173*2015
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
1602016
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
1552016
Computationally efficient robust sparse estimation in high dimensions
S Balakrishnan, SS Du, J Li, A Singh
Conference on Learning Theory, 169-212, 2017
136*2017
Noise thresholds for spectral clustering
S Balakrishnan, M Xu, A Krishnamurthy, A Singh
Advances in Neural Information Processing Systems, 954-962, 2011
1102011
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
942018
Efficient active algorithms for hierarchical clustering
A Krishnamurthy, S Balakrishnan, M Xu, A Singh
arXiv preprint arXiv:1206.4672, 2012
942012
Universal inference
L Wasserman, A Ramdas, S Balakrishnan
Proceedings of the National Academy of Sciences 117 (29), 16880-16890, 2020
862020
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
812020
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
81*2018
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
702020
Minimax localization of structural information in large noisy matrices
S Balakrishnan, M Kolar, A Rinaldo, A Singh
Advances in Neural Information Processing Systems, 909-917, 2011
68*2011
Hypothesis testing for high-dimensional multinomials: A selective review
S Balakrishnan, L Wasserman
622018
Sharp instruments for classifying compliers and generalizing causal effects
EH Kennedy, S Balakrishnan, M G’Sell
532020
HYPOTHESIS TESTING FOR DENSITIES AND HIGH-DIMENSIONAL MULTINOMIALS
S Balakrishnan, L Wasserman
The Annals of Statistics 47 (4), 1893-1927, 2019
532019
Systém momentálně nemůže danou operaci provést. Zkuste to znovu později.
Články 1–20