| 2021 | CLAR: Contrastive Learning of Auditory Representations. | Haider Al-Tahan, Yalda Mohsenzadeh |
| 2021 | On Data Efficiency of Meta-learning. | Maruan Al-Shedivat, Liam Li, Eric P. Xing, Ameet Talwalkar |
| 2021 | Probabilistic Sequential Matrix Factorization. | mer Deniz Akyildiz, Gerrit J. J. van den Burg, Theodoros Damoulas, Mark F. J. Steel |
| 2021 | Mirror Descent View for Neural Network Quantization. | Thalaiyasingam Ajanthan, Kartik Gupta, Philip H. S. Torr, Richard Hartley, Puneet K. Dokania |
| 2021 | Linear Regression Games: Convergence Guarantees to Approximate Out-of-Distribution Solutions. | Kartik Ahuja, Karthikeyan Shanmugam, Amit Dhurandhar |
| 2021 | Non-Volume Preserving Hamiltonian Monte Carlo and No-U-TurnSamplers. | Hadi Mohasel Afshar, Rafael Oliveira, Sally Cripps |
| 2021 | Quantum Tensor Networks, Stochastic Processes, and Weighted Automata. | Sandesh Adhikary, Siddarth Srinivasan, Jacob Miller, Guillaume Rabusseau, Byron Boots |
| 2021 | Dirichlet Pruning for Convolutional Neural Networks. | Kamil Adamczewski, Mijung Park |
| 2021 | Explore the Context: Optimal Data Collection for Context-Conditional Dynamics Models. | Jan Achterhold, Joerg Stueckler |
| 2021 | Instance-Wise Minimax-Optimal Algorithms for Logistic Bandits. | Marc Abeille, Louis Faury, Clment Calauznes |
| 2021 | A Scalable Gradient Free Method for Bayesian Experimental Design with Implicit Models. | Jiaxin Zhang, Sirui Bi, Guannan Zhang |
| 2021 | The Teaching Dimension of Kernel Perceptron. | Akash Kumar, Hanqi Zhang, Adish Singla, Yuxin Chen |
| 2021 | Fenchel-Young Losses with Skewed Entropies for Class-posterior Probability Estimation. | Han Bao, Masashi Sugiyama |
| 2021 | An Efficient Algorithm For Generalized Linear Bandit: Online Stochastic Gradient Descent and Thompson Sampling. | Qin Ding, Cho-Jui Hsieh, James Sharpnack |
| 2021 | Learning-to-Rank with Partitioned Preference: Fast Estimation for the Plackett-Luce Model. | Jiaqi Ma, Xinyang Yi, Weijing Tang, Zhe Zhao, Lichan Hong, Ed H. Chi, Qiaozhu Mei |
| 2021 | On the Privacy Properties of GAN-generated Samples. | Zinan Lin, Vyas Sekar, Giulia Fanti |
| 2021 | An Adaptive-MCMC Scheme for Setting Trajectory Lengths in Hamiltonian Monte Carlo. | Matthew Hoffman, Alexey Radul, Pavel Sountsov |
| 2021 | Contextual Blocking Bandits. | Soumya Basu, Orestis Papadigenopoulos, Constantine Caramanis, Sanjay Shakkottai |
| 2021 | Generalized Spectral Clustering via Gromov-Wasserstein Learning. | Samir Chowdhury, Tom Needham |
| 2021 | On the proliferation of support vectors in high dimensions. | Daniel Hsu, Vidya Muthukumar, Ji Xu |
| 2021 | On the convergence of the Metropolis algorithm with fixed-order updates for multivariate binary probability distributions. | Kai Brgge, Asja Fischer, Christian Igel |
| 2021 | Efficient Statistics for Sparse Graphical Models from Truncated Samples. | Arnab Bhattacharyya, Rathin Desai, Sai Ganesh Nagarajan, Ioannis Panageas |
| 2021 | Evading the Curse of Dimensionality in Unconstrained Private GLMs. | Shuang Song, Thomas Steinke, Om Thakkar, Abhradeep Thakurta |
| 2020 | The Power of Batching in Multiple Hypothesis Testing. | Tijana Zrnic, Daniel L. Jiang, Aaditya Ramdas, Michael I. Jordan |
| 2020 | An Optimal Algorithm for Adversarial Bandits with Arbitrary Delays. | Julian Zimmert, Yevgeny Seldin |