Aaditya Ramdas

Aaditya Ramdas (PhD, 2015) Assistant Professor Department of Statistics and Data Science (75%) Machine Learning Department (25%) Carnegie Mellon University Visiting academic, Amazon (20%). 132H Baker Hall aramdas AT {empty or stat or cs} DOT cmu FULLSTOP edu [http://www.stat.cmu.edu/~aramdas]

These keywords quickly get my attention:

• e-values and confidence sequences (e-processes, supermartingales, testing by betting, sequential inference, optional stopping, peeking and p-hacking, change detection, anytime p-values, Ville's inequality, game-theoretic statistics)

• conformal prediction and calibration (distribution-free inference, uncertainty quantification for black-box machine learning, covariate/label shift, beyond exchangeability)

• multiple testing and post-selection inference (false discovery rate, inference after model selection, online or interactive or bandit testing, post-hoc simultaneous inference)

• high-dimensional, nonparametric statistics and machine learning (kernel methods, minimax rates, dimension-agnostic inference, universal inference, differential privacy, optimization)

I work on “practical theory”, meaning that the vast majority of my papers are about designing theoretically principled algorithms that directly solve practical problems, and are usually based on simple, aesthetically elegant (in my opinion) ideas. A theoretician's goal is not to prove theorems, just as a writer's goal is not to write sentences. My goals are to improve my own (and eventually the field's) understanding of important problems, design creative algorithms for unsolved questions and figure out when and why they work (or don't), and often simply to ask an intriguing question that has not yet been asked.

I'm co-editing a special issue on Conformal Prediction, Probabilistic Calibration and Distribution-Free Uncertainty Quantification, with a submission deadline of Nov 30, 2023. Please consider submitting some of your novel work on the topic.

I'm co-editing (with P. Grunwald) a special issue on Game-theoretic statistics and safe, anytime-valid inference, whose first round of reviews are completed, and which should finally appear in early 2024.

Group

Courses, Workshops, Tutorials, Software, Talks, etc.

Biography

Aaditya Ramdas (PhD, 2015) is an assistant professor at Carnegie Mellon University, in the Departments of Statistics and Machine Learning. He was a postdoc at UC Berkeley (2015–2018) mentored by Michael Jordan and Martin Wainwright, and obtained his PhD at CMU (2010–2015) under Aarti Singh and Larry Wasserman, receiving the Umesh K. Gavaskar Memorial Thesis Award. His undergraduate degree was in Computer Science from IIT Bombay (2005-09).

Aaditya received the IMS Peter Gavin Hall Early Career Prize (2023), was an inaugural recipient of the COPSS Emerging Leader Award (2021), and a recipient of the Bernoulli New Researcher Award (2021). His work is supported by an NSF CAREER Award, an Adobe Faculty Research Award (2019), a Google Research Scholar award (2022), amongst others. He was a CUSO lecturer in 2022 and will be a Lunteren lecturer in 2023.

Aaditya's research is in mathematical statistics and learning, with an eye towards designing algorithms that both have strong theoretical guarantees and also work well in practice. His main research interests include selective and simultaneous inference (interactive, structured, online, post-hoc control of false decision rates, etc), game-theoretic statistics (sequential uncertainty quantification, confidence sequences, always-valid p-values, safe anytime-valid inference, e-processes, supermartingales, etc), and distribution-free black-box predictive inference (conformal prediction, post-hoc calibration, etc). His areas of applied interest include privacy, neuroscience, genetics and auditing (elections, real-estate, financial, fairness), and his group's work has received multiple best paper awards.

He is one of the organizers of the amazing and diverse StatML Group at CMU. Outside of work, some easy topics for conversation include travel/outdoors (hiking, scuba, etc.), trash-free living, completing the Ironman triathlon and long-distance bicycle rides.

Curriculum Vitae

Preprints (under review or revision)

1. Reducing sequential change detection to sequential estimation (with S. Shekhar).       arXiv | TLDR

   We reduce sequential change detection to sequential estimation using confidence sequences, much like Lorden's classical reduction to sequential testing.

2. Total variation floodgate for variable importance inference in classification (with W. Wang, L. Janson, L. Lei).       arXiv | TLDR

   We define the expected total variation (ETV), which is an intuitive, model-agnostic measure of variable importance and design algorithms for statistical inference on the ETV under design-based/model-X assumptions.

3. More powerful multiple testing under dependence via randomization (with Z. Xu).       arXiv | TLDR

   We show that the power of three procedures for multiple testing under arbitrary dependence --- Benjamini-Yekutieli, e-BH and Simes --- can be strictly improved using a simple uniform external randomization.

4. Differentially private conditional independence testing (with I. Kalemaj, S. Kasiviswanathan).       arXiv | TLDR

   We derive differentially private versions of the generalized covariance measure (GCM), in both observational settings and under the model-X assumption, the primary difficulty of which arises from the fact that changing one datapoint changes all the GCM residuals.

5. Randomized and exchangeable improvements of Markov's, Chebyshev's and Chernoff's inequalities (with T. Manole).       arXiv

6. The extended Ville's inequality for nonintegrable nonnegative supermartingales (with H. Wang).       arXiv | TLDR

   We present a rigorous study of supermartingales and their maximal inequalities without the traditional L1-integrability assumption, which typically arise as infinite mixtures of traditional, L1-integrable martingales; applications include deriving "frequentist" confidence sequences despite using Bayesian flat, non-informative priors.

7. A unified recipe for deriving (time-uniform) PAC-Bayes bounds (with B. Chugg, H. Wang).       arXiv

8. A sequential test for log-concavity (with A. Gangrade, A. Rinaldo).       arXiv

9. Anytime-valid off-policy inference for contextual bandits (with I. Waudby-Smith, L. Wu, N. Karampatziakis, P. Mineiro).       arXiv

10. E-detectors: a nonparametric framework for online changepoint detection (with J. Shin, A. Rinaldo).       arXiv  

11. Admissible anytime-valid sequential inference must rely on nonnegative martingales (with J. Ruf, M. Larsson, W. Koolen).       arXiv

12. Time-uniform central limit theory and asymptotic confidence sequences (with I. Waudby-Smith, D. Arbour, R. Sinha, E. H. Kennedy).       arXiv | code

13. Post-selection inference for e-value based confidence intervals (with Z. Xu, R. Wang).       arXiv | talk | slides | TLDR

    We propose the e-BY procedure for post-selection inference (false coverage rate of chosen confidence intervals), which allows the Benjamini-Yekutieli procedure be applied under both arbitrary selection rules and dependence without an extra log factor correction when using e-value based CIs.

14. Interactive identification of individuals with positive treatment effect while controlling false discoveries (with B. Duan, L. Wasserman).       arXiv

15. Multiple testing under negative dependence (with Z. Chi, R. Wang).       arXiv

16. A permutation-free kernel independence test (with S. Shekhar, I. Kim).       arXiv | code | TLDR

    We propose a new kernel-HSIC statistic that drops half the terms of the original, and show that it has a standard normal limiting null distribution under low and high dimensional regimes, resulting in a test that is trivial to calibrate without permutations. The analysis of this statistic requires generalizing the techniques we developed earlier for the corresponding kernel-MMD statistic, to deal with the more complicated dependence structure.

17. Universal inference meets random projections: a scalable test for log-concavity (with R. Dunn, A. Gangrade, L. Wasserman).       arXiv | code | TLDR

    We develop the first provably valid test for log-concavity, which is a shape constraint for density estimation with applications across economics, survival modeling, and reliability theory. The test is based on universal inference and a scalable variant using random projections is developed.

18. De Finetti's Theorem and related results for infinite weighted exchangeable sequences (with R. Barber, E. Candes, R. Tibshirani).       arXiv

19. On the existence of powerful p-values and e-values for composite hypotheses (with Z. Zhang, R. Wang).       arXiv

Published (or accepted) papers

1. Data fission: splitting a single data point (with J. Leiner, B. Duan, L. Wasserman), J of American Stat Assoc, 2023 arXiv | TLDR

   We devise an alternative to data splitting using external randomization called data fission that more efficiently splits information in many circumstances and then apply it to several examples in post-selection inference: interactive multiple testing, fixed-design linear regression, generalized linear models, and trend filtering.

2. Adaptive privacy composition for accuracy-first mechanisms (with R. Rogers, G. Samorodnitsky, S. Wu), Conf. on Neural Information Processing Systems (NeurIPS), 2023 arXiv | TLDR

   We derive basic and advanced composition results and privacy filters for noise-reduction mechanisms that allow an analyst to adaptively switch between differentially private and ex-post private mechanisms subject to an overall privacy guarantee.

3. Sequential predictive two-sample and independence testing (with A. Podkopaev), Conf. on Neural Information Processing Systems (NeurIPS), 2023 arXiv

4. Auditing fairness by betting (with B. Chugg, S. Cortes-Gomez, B. Wilder), Conf. on Neural Information Processing Systems (NeurIPS), 2023 arXiv | code

5. Counterfactually comparing abstaining classifiers (with Y. J. Choe, A. Gangrade), Conf. on Neural Information Processing Systems (NeurIPS), 2023 arXiv

6. An efficient doubly-robust test for the kernel treatment effect (with D. Martinez-Taboada, E. Kennedy), Conf. on Neural Information Processing Systems (NeurIPS), 2023 arXiv

7. On the sublinear regret of GP-UCB (with J. Whitehouse, S. Wu), Conf. on Neural Information Processing Systems (NeurIPS), 2023 arXiv | TLDR

   By appropriately regularizing simple confidence sequences in Hilbert spaces, we derive (for the first time) sublinear regret for GP-UCB for any kernel with polynomial decay (including Matern).

8. A composite generalization of Ville's martingale theorem (with J. Ruf, M. Larsson, W. Koolen), Elec. J. of Prob., 2023 arXiv

9. Online multiple hypothesis testing (with D. Robertson, J. Wason), Statistical Science, 2023 arXiv

10. Nonparametric two-sample testing by betting (with S. Shekhar), IEEE Trans. on Info. Theory, 2023       arXiv | code | slides | TLDR

    We develop a general framework for designing sequential two-sample tests, and obtain a general characterization of the power of these tests in terms of the regret of an associated online prediction game. This yields the ``right'' sequential generalizations of many offline nonparametric two-sample tests like Kolmogorov-Smirnov or kernel-MMD.

11. E-values as unnormalized weights in multiple testing (with N. Ignatiadis, R. Wang), Biometrika, 2023 arXiv | proc

12. Comparing sequential forecasters (with Y.J. Choe), Operations Research, 2023 arXiv | code | talk | poster | slides (Citadel, Research Showcase Runner-up)

13. Game-theoretic statistics and safe anytime-valid inference (with P. Grunwald, V. Vovk, G. Shafer), Statistical Science, 2023 arXiv

14. Martingale methods for sequential estimation of convex functionals and divergences (with T. Manole), IEEE Trans. on Information Theory, 2023 arXiv | article | talk (Student Research Award, Stat Soc Canada) | TLDR

    We derive confidence sequences for convex functionals, with an emphasis on convex divergences such as the kernel Maximum Mean Discrepancy and Wasserstein distances; our main technical contribution is to show that empirical plugins of convex functionals/divergences (and more generally processes satisfying a leave-one-out property) are partially ordered reverse submartingales, coupled with maximal inequalities for such processes.

15. Estimating means of bounded random variables by betting (with I. Waudby-Smith), J. of the Royal Statistical Society, Series B, 2023 arXiv (Discussion paper) | code

16. Sequential change detection via backward confidence sequences (with S. Shekhar). Intl. Conf. on Machine Learning (ICML), 2023   arXiv | code | slides | TLDR

    We derive a general reduction from constructing confidence sequences (CSs) for some functional~(say $\theta$) to detecting changes in that functional: given a stream of observations, construct a single CS (for $\theta$) in the forward direction, and a new CS in the backward direction with each new observation, and stop and declare a changepoint as soon as they do not intersect. We obtain tight guarantees on the average run length~(ARL) and the detection delay for this general strategy, and instantiate them for several classical and modern change detection problems.

17. Fully adaptive composition in differential privacy (with J. Whitehouse, R. Rogers, Z. S. Wu), Intl. Conf. on Machine Learning (ICML), 2023 arXiv

18. Online Platt scaling with calibeating (with C. Gupta), Intl. Conf. on Machine Learning (ICML), 2023 arXiv

19. A nonparametric extension of randomized response for locally private confidence sets (with I. Waudby-Smith, Z. S. Wu), Intl. Conf. on Machine Learning (ICML), 2023 arXiv | code (oral talk)

20. Sequential kernelized independence testing (with A. Podkopaev, P. Bloebaum, S. Kasiviswanathan), Intl. Conf. on Machine Learning (ICML), 2023 arXiv

21. Risk-limiting financial audits via weighted sampling without replacement (with S. Shekhar, Z. Xu, Z. Lipton, P. Liang), Intl. Conf. Uncertainty in AI (UAI), 2023 arXiv | TLDR

    We introduce the notion of risk-limiting financial audits (RLFA), where the goal is to design statistical procedures to verify an assertion about a set of reported financial transactions. We propose a general RLFA strategy using confidence sequences constructed with weighted sampling without replacement, and also develop techniques that can incorporate any available side information (such as predictions from AI models).

22. Huber-robust confidence sequences (with H. Wang), Intl. Conf. on AI and Statistics (AISTATS), 2023, arXiv (full oral talk) | TLDR

    Under a slight generalization of Huber's epsilon-contamination model (where epsilon fraction of the points are arbitrarily corrupted), we derive confidence sequences for univariate means only assuming a finite p-th moment (for p between 1 and 2), which are minimax optimal and perform very well in practice.

23. Catoni-style confidence sequences for heavy-tailed mean estimation (with H. Wang), Stochastic Processes and Applications, 2023 arXiv | article | code | TLDR

    We derive confidence sequences, which are confidence intervals valid at arbitrary stopping times, for univariate means only assuming a finite p-th moment (for p between 1 and 2), which are minimax optimal and perform very well in practice.

24. Anytime-valid confidence sequences in an enterprise A/B testing platform (with A. Maharaj, R. Sinha, D. Arbour, I. Waudby-Smith, S. Liu, M. Sinha, R. Addanki, M. Garg, V. Swaminathan), ACM Web Conference (WWW), 2023 arXiv

25. Dimension-agnostic inference using cross U-statistics (with I. Kim), Bernoulli, 2023 arXiv | TLDR

    We introduce dimension-agnostic inference, which is a novel approach for high-dimensional inference that ensures asymptotic validity regardless of how the dimension and sample size scale, while preserving minimax optimal power across diverse scenarios; our main tool is a cross U-statistic, which drops half of the terms of a degenerate U-statistic to yield a limiting Gaussian distribution.

26. On the power of conditional independence testing under model-X (with E. Katsevich), Electronic J. Stat, 2023 arXiv | article

27. Permutation tests using arbitrary permutation distributions (with R. Barber, E. Candes, R. Tibshirani), Sankhya A, 2023 arXiv | article

28. Conformal prediction beyond exchangeability (with R. Barber, E. Candes, R. Tibshirani), Annals of Stat., 2023 arXiv | article

29. Faster online calibration without randomization: interval forecasts and the power of two choices (with C. Gupta), Conf. on Learning Theory (COLT), 2022 arXiv | article

30. Top-label calibration and multiclass-to-binary reductions (with C. Gupta), Intl. Conf. on Learning Representations, 2022 arXiv | article

31. Gaussian universal likelihood ratio testing (with R. Dunn, S. Balakrishnan, L. Wasserman), Biometrika, 2022 arXiv | article | TLDR

    Under a Gaussian setting, we present the first in-depth exploration of the size, power, and relationships between several universal inference variants. We find that in this setting, the power of universal inference has the same behavior in n, d, alpha and SNR as the classical Wilks' Theorem approach, only losing in a small constant of about 2.

32. A permutation-free kernel two sample test (with S. Shekhar, I. Kim), Conf. on Neural Information Processing Systems (NeurIPS), 2022 arXiv | article | code | (oral talk) | TLDR

    We propose a new kernel-MMD statistic that drops half the terms of the original, and show that it has a standard normal limiting null distribution in low and high dimensional regimes. This results in a test that is easy to calibrate, that is up to two orders of magnitude faster than running the permutation test, at the price of a small ($\approx \sqrt{2}$ in effective sample size) reduction in power.

33. Testing exchangeability: fork-convexity, supermartingales, and e-processes (with J. Ruf, M. Larsson, W. Koolen). Intl J. of Approximate Reasoning, 2022 arXiv | article

34. Tracking the risk of a deployed model and detecting harmful distribution shifts (with A. Podkopaev). Intl. Conf. on Learning Representations (ICLR), 2022 arXiv | article

35. Brownian noise reduction: maximizing privacy subject to accuracy constraints (with J. Whitehouse, Z.S. Wu, R. Rogers), Conf. on Neural Information Processing Systems (NeurIPS), 2022 arXiv | article

36. Sequential estimation of quantiles with applications to A/B-testing and best-arm identification (with S. Howard), Bernoulli, 2022 arXiv | article | code

37. Brainprints: identifying individuals from magnetoencephalograms (with S. Wu, L. Wehbe), Nature Communications Biology, 2022 bioRxiv | article

38. Interactive rank testing by betting (with B. Duan, L. Wasserman), Conf. on Causal Learning and Reasoning (CLEAR), 2022 arXiv | article (oral talk)

39. Large-scale simultaneous inference under dependence (with J. Tian, X. Chen, E. Katsevich, J. Goeman), Scandanavian J of Stat., 2022 arXiv | article

40. False discovery rate control with e-values (with R. Wang), J. of the Royal Stat. Soc., Series B, 2022 arXiv | article

41. Nested conformal prediction and quantile out-of-bag ensemble methods (with C. Gupta, A. Kuchibhotla), Pattern Recognition, 2022 arXiv | article | code

42. Distribution-free prediction sets for two-layer hierarchical models (with R. Dunn, L. Wasserman), J of American Stat. Assoc., 2022 arXiv | article | code | TLDR

    Conformal methods typically rely on exchangeable data to provide valid prediction sets in finite samples, but we extend conformal methods to construct prediction sets in a nonexchangeable two-layer hierarchical setting, where N groups of data are exchangeable, and the observations within each group are also exchangeable.

43. Fast and powerful conditional randomization testing via distillation (with M. Liu, E. Katsevich, L. Janson), Biometrika, 2021 arXiv | article | code

44. Uncertainty quantification using martingales for misspecified Gaussian processes (with W. Neiswanger), Algorithmic Learning Theory (ALT), 2021 arXiv | article | code | talk

45. RiLACS: Risk-limiting audits via confidence sequences (with I. Waudby-Smith, P. Stark), Intl. Conf. for Electronic Voting (EVoteID), 2021 arXiv | article | code (Best Paper award)

46. Predictive inference with the jackknife+ (with R. Barber, E. Candes, R. Tibshirani), Annals of Stat., 2021 arXiv | article | code

47. Path length bounds for gradient descent and flow (with C. Gupta, S. Balakrishnan), J. of Machine Learning Research, 2021 arXiv | article | blog

48. Nonparametric iterated-logarithm extensions of the sequential generalized likelihood ratio test (with J. Shin, A. Rinaldo), IEEE J. on Selected Areas in Info. Theory, 2021 arXiv | article

49. Time-uniform, nonparametric, nonasymptotic confidence sequences (with S. Howard, J. Sekhon, J. McAuliffe), The Annals of Stat., 2021 arXiv | article | code | tutorial

50. Off-policy confidence sequences (with N. Karampatziakis, P. Mineiro), Intl. Conf. on Machine Learning (ICML), 2021 arXiv | article

51. Best arm identification under additive transfer bandits (with O. Neopane, A. Singh), Asilomar Conf. on Signals, Systems and Computers, 2021 arXiv | article (Best Student Paper award)

52. On the bias, risk and consistency of sample means in multi-armed bandits (with J. Shin, A. Rinaldo), SIAM J. on the Math. of Data Science, 2021 arXiv | article | talk

53. Dynamic algorithms for online multiple testing (with Z. Xu), Conf. on Math. and Scientific Machine Learning, 2021 arXiv | article | talk | slides | code | TLDR

    We develop the first practically powerful algorithms that provably controls the supremum of the false discovery proportion with high probability in online multiple testing.

54. Online control of the familywise error rate (with J. Tian), Statistical Methods in Medical Research, 2021 arXiv | article

55. Asynchronous online testing of multiple hypotheses (with T. Zrnic, M. Jordan), J. of Machine Learning Research, 2021 arXiv | article | code | blog

56. Classification accuracy as a proxy for two sample testing (with I. Kim, A. Singh, L. Wasserman), Annals of Stat., 2021 arXiv | article | (JSM Stat Learning Student Paper Award) | TLDR

    We explore the use of classification accuracy for two-sample testing for general classifiers, proving in particular that the accuracy test based on Fisher's LDA achieves minimax rate-optimal power and establishing conditions for consistency based on general classifiers.

57. Distribution-free calibration guarantees for histogram binning without sample splitting (with C. Gupta), Intl. Conf. on Machine Learning, 2021 arXiv | article

58. Distribution-free uncertainty quantification for classification under label shift (with A. Podkopaev), Conf. on Uncertainty in AI, 2021 arXiv | article

59. Distribution-free binary classification: prediction sets, confidence intervals and calibration (with C. Gupta, A. Podkopaev), Conf. on Neural Information Processing Systems (NeurIPS), 2020 arXiv | article (spotlight talk)

60. The limits of distribution-free conditional predictive inference (with R. Barber, E. Candes, R. Tibshirani), Information and Inference, 2020 arXiv | article

61. Analyzing student strategies in blended courses using clickstream data (with N. Akpinar, U. Acar), Educational Data Mining, 2020 arXiv | article | talk (oral talk)

62. The power of batching in multiple hypothesis testing (with T. Zrnic, D. Jiang, M. Jordan), Intl. Conf. on AI and Statistics, 2020 arXiv | article | talk

63. Online control of the false coverage rate and false sign rate (with A. Weinstein), Intl. Conf. on Machine Learning (ICML), 2020 arXiv | article

64. Confidence sequences for sampling without replacement (with I. Waudby-Smith), Conf. on Neural Information Processing Systems (NeurIPS), 2020 arXiv | article | code (spotlight talk)

65. Universal inference (with L. Wasserman, S. Balakrishnan), Proc. of the National Academy of Sciences, 2020 arXiv | article | talk

66. A unified framework for bandit multiple testing (with Z. Xu, R. Wang), Conf. on Neural Information Processing Systems (NeurIPS), 2020 arXiv | article | talk | slides | code | TLDR

    Using e-values (or e-processes) and the e-BH procedure, we formulate a framework which provides false discovery rate (FDR) control at any stopping time for multiple testing in the bandit setting, that is robust to the dependencies induced by the user’s sampling and stopping policies.

67. Simultaneous high-probability bounds on the FDP in structured, regression and online settings (with E. Katsevich), Annals of Stat., 2020 arXiv | article | code

68. Time-uniform Chernoff bounds via nonnegative supermartingales (with S. Howard, J. Sekhon, J. McAuliffe), Prob. Surveys, 2020 arXiv | article | talk

69. STAR: A general interactive framework for FDR control under structural constraints (with L. Lei, W. Fithian), Biometrika, 2020 arXiv | article | poster | code

70. Familywise error rate control by interactive unmasking (with B. Duan, L. Wasserman), Intl. Conf. on Machine Learning (ICML), 2020 arXiv | article | code

71. Interactive martingale tests for the global null (with B. Duan, S. Balakrishnan, L. Wasserman), Electronic J. of Stat., 2020 arXiv | article | code

72. On conditional versus marginal bias in multi-armed bandits (with J. Shin, A. Rinaldo), Intl. Conf. on Machine Learning (ICML), 2020 arXiv | article

73. Are sample means in multi-armed bandits positively or negatively biased? (with J. Shin, A. Rinaldo), Conf. on Neural Information Processing Systems (NeurIPS), 2019 arXiv | article | poster

74. A higher order Kolmogorov-Smirnov test (with V. Sadhanala, Y. Wang, R. Tibshirani), Intl. Conf. on AI and Statistics, 2019 arXiv | article

75. ADDIS: an adaptive discarding algorithm for online FDR control with conservative nulls (with J. Tian), Conf. on Neural Information Processing Systems (NeurIPS), 2019 arXiv | code | article

76. A unified treatment of multiple testing with prior knowledge using the p-filter (with R. F. Barber, M. Wainwright, M. Jordan), Annals of Stat., 2019 arXiv | article | code

77. DAGGER: A sequential algorithm for FDR control on DAGs (with J. Chen, M. Wainwright, M. Jordan), Biometrika, 2019 arXiv | article | code

78. Conformal prediction under covariate shift (with R. Tibshirani, R. Barber, E. Candes), Conf. on Neural Information Processing Systems (NeurIPS), 2019 arXiv | article | poster

79. Optimal rates and tradeoffs in multiple testing (with M. Rabinovich, M. Wainwright, M. Jordan), Statistica Sinica, 2019 arXiv | article | poster

80. Function-specific mixing times and concentration away from equilibrium (with M. Rabinovich, M. Wainwright, M. Jordan), Bayesian Analysis, 2019 arXiv | article | poster

81. Decoding from pooled data (II): sharp information-theoretic bounds (with A. El-Alaoui, F. Krzakala, L. Zdeborova, M. Jordan), SIAM J. on Math. of Data Science, 2019 arXiv | article

82. Decoding from pooled data (I): phase transitions of message passing (with A. El-Alaoui, A. Ramdas, F. Krzakala, L. Zdeborova, M. Jordan), IEEE Trans. on Info. Theory, 2018 arXiv | article

83. On the power of online thinning in reducing discrepancy (with R. Dwivedi, O. N. Feldheim, Ori Gurel-Gurevich), Prob. Theory and Related Fields, 2018 arXiv | article | poster

84. On kernel methods for covariates that are rankings (with H. Mania, M. Wainwright, M. Jordan, B. Recht), Electronic J. of Stat., 2018 arXiv | article

85. SAFFRON: an adaptive algorithm for online FDR control (with T. Zrnic, M. Wainwright, M. Jordan), Intl. Conf. on Machine Learning (ICML), 2018 arXiv | article | code (full oral talk)

86. Online control of the false discovery rate with decaying memory (with F. Yang, M. Wainwright, M. Jordan), Conf. on Neural Information Processing Systems (NeurIPS), 2017 arXiv | article | poster | talk (from 44:00) (full oral talk)

87. MAB-FDR: Multi (A)rmed\/(B)andit testing with online FDR control (with F. Yang, K. Jamieson, M. Wainwright), Conf. on Neural Information Processing Systems (NeurIPS), 2017 arXiv | article | code (spotlight talk)

88. QuTE: decentralized FDR control on sensor networks (with J. Chen, M. Wainwright, M. Jordan), IEEE Conf. on Decision and Control, 2017 arXiv | article | code | poster

89. Iterative methods for solving factorized linear systems (with A. Ma, D. Needell), SIAM J. on Matrix Analysis and Applications, 2017 arXiv | article

90. Rows vs. columns : randomized Kaczmarz or Gauss-Seidel for ridge regression (with A. Hefny, D. Needell), SIAM J. on Scientific Computing, 2017 arXiv | article

91. On Wasserstein two sample testing and related families of nonparametric tests (with N. Garcia, M. Cuturi), Entropy, 2017 arXiv | article

92. Generative models and model criticism via optimized maximum mean discrepancy (with D. Sutherland, H. Tung, H. Strathmann, S. De, A. Smola, A. Gretton), Intl. Conf. on Learning Representations, 2017 arXiv | article | poster | code

93. Minimax lower bounds for linear independence testing (with D. Isenberg, A. Singh, L. Wasserman), IEEE Intl. Symp. on Information Theory, 2016 arXiv | article

94. p-filter: multi-layer FDR control for grouped hypotheses (with COAUTHORS), J. of the Royal Stat. Society, Series B, 2016 arXiv | article |code | poster

95. Sequential nonparametric testing with the law of the iterated logarithm (with A. Balsubramani), Conf. on Uncertainty in AI, 2016 arXiv | article | errata

96. Asymptotic behavior of Lq-based Laplacian regularization in semi-supervised learning (with A. El-Alaoui, X. Cheng, M. Wainwright, M. Jordan), Conf. on Learning Theory, 2016 arXiv | article

97. Regularized brain reading with shrinkage and smoothing (with L. Wehbe, R. Steorts, C. Shalizi), Annals of Applied Stat., 2015 arXiv | article

98. On the high-dimensional power of a linear-time two sample test under mean-shift alternatives (with S. Reddi, A. Singh, B. Poczos, L. Wasserman), Intl. Conf. on AI and Statistics, 2015 arXiv | article | errata

99. On the decreasing power of kernel and distance based nonparametric hypothesis tests in high dimensions (with S. Reddi\*, B. Poczos, A. Singh, L. Wasserman), AAAI Conf. on Artificial Intelligence, 2015 arXiv | article | supp

100. Fast two-sample testing with analytic representations of probability measures (with K. Chwialkowski, D. Sejdinovic, A. Gretton), Conf. on Neural Information Processing Systems (NeurIPS), 2015 arXiv | article | code

101. Nonparametric independence testing for small sample sizes (with L. Wehbe), Intl. Joint Conf. on AI, 2015 arXiv | article (oral talk)

102. Convergence properties of the randomized extended Gauss-Seidel and Kaczmarz methods (with A. Ma, D. Needell), SIAM J. on Matrix Analysis and Applications, 2015 arXiv | article | code

103. Fast & flexible ADMM algorithms for trend filtering (with R. Tibshirani), J. of Computational and Graphical Statistics, 2015 arXiv | article | talk | code

104. Towards a deeper geometric, analytic and algorithmic understanding of margins (with J. Pena), Opt. Methods and Software, 2015 arXiv | article

105. Margins, kernels and non-linear smoothed perceptrons (with J. Pena), Intl. Conf. on Machine Learning (ICML), 2014 arXiv | article | poster | talk oral talk

106. Simultaneously uncovering the patterns of brain regions involved in different story reading subprocesses (with L. Wehbe, B. Murphy, P. Talukdar, A. Fyshe, T. Mitchell), PLoS ONE, 2014 website | article

107. An analysis of active learning with uniform feature noise (with A. Singh, L. Wasserman, B. Poczos), Intl. Conf. on AI and Statistics, 2014 arXiv | article | poster | talk (oral talk)

108. Algorithmic connections between active learning and stochastic convex optimization (with A. Singh), Conf. on Algorithmic Learning Theory (ALT), 2013 arXiv | article | poster

109. Optimal rates for stochastic convex optimization under Tsybakov's noise condition (with A. Singh), Intl. Conf. on Machine Learning (ICML), 2013 arXiv | article | poster | talk (oral talk)

Miscellaneous

1. Adaptivity & computation-statistics tradeoffs for kernel & distance based high-dimensional two sample testing (with S. Reddi, B. Poczos, A. Singh, L. Wasserman).       arXiv | poster

2. Algorithms for graph similarity and subgraph matching (with D. Koutra, A. Parikh, J. Xiang).       report