| Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
| 1 | Ilja Kuzborskij, Csaba Szepesvári |
Nonparametric Regression with Shallow Overparameterized Neural Networks Trained by GD with Early Stopping.  |
COLT  |
2021 |
DBLP BibTeX RDF |
|
| 1 | Philippe Casgrain, Anastasis Kratsios |
Optimizing Optimizers: Regret-optimal gradient descent algorithms. |
COLT |
2021 |
DBLP BibTeX RDF |
|
| 1 | Zhiyan Ding, Qin Li 0007, Jianfeng Lu 0001, Stephen J. Wright 0001 |
Random Coordinate Langevin Monte Carlo. |
COLT |
2021 |
DBLP BibTeX RDF |
|
| 1 | Sushant Agarwal, Nivasini Ananthakrishnan, Shai Ben-David, Tosca Lechner, Ruth Urner |
Open Problem: Are all VC-classes CPAC learnable? |
COLT |
2021 |
DBLP BibTeX RDF |
|
| 1 | Ankur Moitra, Elchanan Mossel, Colin Sandon |
Learning to Sample from Censored Markov Random Fields. |
COLT |
2021 |
DBLP BibTeX RDF |
|
| 1 | Huck Bennett, Anindya De, Rocco A. Servedio, Emmanouil-Vasileios Vlatakis-Gkaragkounis |
Reconstructing weighted voting schemes from partial information about their power indices. |
COLT |
2021 |
DBLP BibTeX RDF |
|
| 1 | Cyrus Rashtchian, David P. Woodruff, Peng Ye 0005, Hanlin Zhu |
Average-Case Communication Complexity of Statistical Problems. |
COLT |
2021 |
DBLP BibTeX RDF |
|
| 1 | Idan Amir, Tomer Koren, Roi Livni |
SGD Generalizes Better Than GD (And Regularization Doesn't Help). |
COLT |
2021 |
DBLP BibTeX RDF |
|
| 1 | Christopher Jung 0001, Changhwa Lee, Mallesh M. Pai, Aaron Roth 0001, Rakesh Vohra |
Moment Multicalibration for Uncertainty Estimation. |
COLT |
2021 |
DBLP BibTeX RDF |
|
| 1 | Luca Ganassali, Laurent Massoulié, Marc Lelarge |
Impossibility of Partial Recovery in the Graph Alignment Problem. |
COLT |
2021 |
DBLP BibTeX RDF |
|
| 1 | Arun Sai Suggala, Pradeep Ravikumar, Praneeth Netrapalli |
Efficient Bandit Convex Optimization: Beyond Linear Losses. |
COLT |
2021 |
DBLP BibTeX RDF |
|
| 1 | Mo Zhou, Rong Ge 0001, Chi Jin 0001 |
A Local Convergence Theory for Mildly Over-Parameterized Two-Layer Neural Network. |
COLT |
2021 |
DBLP BibTeX RDF |
|
| 1 | Haike Xu, Tengyu Ma 0001, Simon S. Du |
Fine-Grained Gap-Dependent Bounds for Tabular MDPs via Adaptive Multi-Step Bootstrap. |
COLT |
2021 |
DBLP BibTeX RDF |
|
| 1 | Badih Ghazi, Ravi Kumar 0001, Pasin Manurangsi |
On Avoiding the Union Bound When Answering Multiple Differentially Private Queries. |
COLT |
2021 |
DBLP BibTeX RDF |
|
| 1 | Michal Derezinski, Zhenyu Liao 0001, Edgar Dobriban, Michael W. Mahoney |
Sparse sketches with small inversion bias. |
COLT |
2021 |
DBLP BibTeX RDF |
|
| 1 | Anindya De, Rocco A. Servedio |
Weak learning convex sets under normal distributions. |
COLT |
2021 |
DBLP BibTeX RDF |
|
| 1 | Yulong Lu, Jianfeng Lu 0001, Min Wang |
A Priori Generalization Analysis of the Deep Ritz Method for Solving High Dimensional Elliptic Partial Differential Equations. |
COLT |
2021 |
DBLP BibTeX RDF |
|
| 1 | Niladri S. Chatterji, Philip M. Long, Peter L. Bartlett |
When does gradient descent with logistic loss interpolate using deep networks with smoothed ReLU activations? |
COLT |
2021 |
DBLP BibTeX RDF |
|
| 1 | Blake E. Woodworth, Brian Bullins, Ohad Shamir, Nathan Srebro |
The Min-Max Complexity of Distributed Stochastic Convex Optimization with Intermittent Communication. |
COLT |
2021 |
DBLP BibTeX RDF |
|
| 1 | Praneeth Kacham, David P. Woodruff |
Reduced-Rank Regression with Operator Norm Error. |
COLT |
2021 |
DBLP BibTeX RDF |
|
| 1 | Raef Bassily, Cristóbal Guzmán, Anupama Nandi |
Non-Euclidean Differentially Private Stochastic Convex Optimization. |
COLT |
2021 |
DBLP BibTeX RDF |
|
| 1 | Pan Peng 0001, Jiapeng Zhang |
Towards a Query-Optimal and Time-Efficient Algorithm for Clustering with a Faulty Oracle. |
COLT |
2021 |
DBLP BibTeX RDF |
|
| 1 | Chicheng Zhang, Yinan Li |
Improved Algorithms for Efficient Active Learning Halfspaces with Massart and Tsybakov Noise. |
COLT |
2021 |
DBLP BibTeX RDF |
|
| 1 | Steve Hanneke |
Open Problem: Is There an Online Learning Algorithm That Learns Whenever Online Learning Is Possible? |
COLT |
2021 |
DBLP BibTeX RDF |
|
| 1 | Eran Malach, Gilad Yehudai, Shai Shalev-Shwartz, Ohad Shamir |
The Connection Between Approximation, Depth Separation and Learnability in Neural Networks. |
COLT |
2021 |
DBLP BibTeX RDF |
|
| 1 | Steve Hanneke, Roi Livni, Shay Moran |
Online Learning with Simple Predictors and a Combinatorial Characterization of Minimax in 0/1 Games. |
COLT |
2021 |
DBLP BibTeX RDF |
|
| 1 | Angeliki Giannou, Emmanouil-Vasileios Vlatakis-Gkaragkounis, Panayotis Mertikopoulos |
Survival of the strictest: Stable and unstable equilibria under regularized learning with partial information. |
COLT |
2021 |
DBLP BibTeX RDF |
|
| 1 | Mikito Nanashima |
A Theory of Heuristic Learnability. |
COLT |
2021 |
DBLP BibTeX RDF |
|
| 1 | Cong Fang 0001, Jason D. Lee, Pengkun Yang, Tong Zhang 0001 |
Modeling from Features: a Mean-field Framework for Over-parameterized Deep Neural Networks. |
COLT |
2021 |
DBLP BibTeX RDF |
|
| 1 | Difan Zou, Jingfeng Wu, Vladimir Braverman, Quanquan Gu, Sham M. Kakade |
Benign Overfitting of Constant-Stepsize SGD for Linear Regression. |
COLT |
2021 |
DBLP BibTeX RDF |
|
| 1 | Haim Kaplan, Yishay Mansour, Uri Stemmer |
The Sparse Vector Technique, Revisited. |
COLT |
2021 |
DBLP BibTeX RDF |
|
| 1 | Adam Block, Yuval Dagan, Alexander Rakhlin |
Majorizing Measures, Sequential Complexities, and Online Learning. |
COLT |
2021 |
DBLP BibTeX RDF |
|
| 1 | Tor Lattimore, András György 0001 |
Mirror Descent and the Information Ratio. |
COLT |
2021 |
DBLP BibTeX RDF |
|
| 1 | Mikhail Belkin, Samory Kpotufe (eds.) |
Conference on Learning Theory, COLT 2021, 15-19 August 2021, Boulder, Colorado, USA. |
COLT |
2021 |
DBLP BibTeX RDF |
|
| 1 | Yin Tat Lee, Ruoqi Shen, Kevin Tian |
Structured Logconcave Sampling with a Restricted Gaussian Oracle. |
COLT |
2021 |
DBLP BibTeX RDF |
|
| 1 | Zihan Zhang, Xiangyang Ji, Simon S. Du |
Is Reinforcement Learning More Difficult Than Bandits? A Near-optimal Algorithm Escaping the Curse of Horizon. |
COLT |
2021 |
DBLP BibTeX RDF |
|
| 1 | Gal Vardi, Daniel Reichman 0001, Toniann Pitassi, Ohad Shamir |
Size and Depth Separation in Approximating Benign Functions with Neural Networks. |
COLT |
2021 |
DBLP BibTeX RDF |
|
| 1 | Xue Chen, Michal Derezinski |
Query complexity of least absolute deviation regression via robust uniform convergence. |
COLT |
2021 |
DBLP BibTeX RDF |
|
| 1 | Dheeraj Baby, Yu-Xiang Wang 0003 |
Optimal Dynamic Regret in Exp-Concave Online Learning. |
COLT |
2021 |
DBLP BibTeX RDF |
|
| 1 | Yury Makarychev, Ali Vakilian |
Approximation Algorithms for Socially Fair Clustering. |
COLT |
2021 |
DBLP BibTeX RDF |
|
| 1 | Dylan J. Foster, Alexander Rakhlin, David Simchi-Levi, Yunzong Xu |
Instance-Dependent Complexity of Contextual Bandits and Reinforcement Learning: A Disagreement-Based Perspective. |
COLT |
2021 |
DBLP BibTeX RDF |
|
| 1 | Noah Golowich |
Differentially Private Nonparametric Regression Under a Growth Condition. |
COLT |
2021 |
DBLP BibTeX RDF |
|
| 1 | Maciej Skorski |
Johnson-Lindenstrauss Transforms with Best Confidence. |
COLT |
2021 |
DBLP BibTeX RDF |
|
| 1 | Sinho Chewi, Chen Lu 0002, Kwangjun Ahn, Xiang Cheng, Thibaut Le Gouic, Philippe Rigollet |
Optimal dimension dependence of the Metropolis-Adjusted Langevin Algorithm. |
COLT |
2021 |
DBLP BibTeX RDF |
|
| 1 | Gen Li 0005, Yuting Wei, Yuejie Chi, Yuantao Gu, Yuxin Chen 0002 |
Softmax Policy Gradient Methods Can Take Exponential Time to Converge. |
COLT |
2021 |
DBLP BibTeX RDF |
|
| 1 | Gabriel P. Andrade, Rafael M. Frongillo, Georgios Piliouras |
Learning in Matrix Games can be Arbitrarily Complex. |
COLT |
2021 |
DBLP BibTeX RDF |
|
| 1 | Vladimir Braverman, Robert Krauthgamer, Aditya Krishnan 0001, Shay Sapir |
Near-Optimal Entrywise Sampling of Numerically Sparse Matrices. |
COLT |
2021 |
DBLP BibTeX RDF |
|
| 1 | Anindya De, Ryan O'Donnell, Rocco A. Servedio |
Learning sparse mixtures of permutations from noisy information. |
COLT |
2021 |
DBLP BibTeX RDF |
|
| 1 | Gergely Neu |
Information-Theoretic Generalization Bounds for Stochastic Gradient Descent. |
COLT |
2021 |
DBLP BibTeX RDF |
|
| 1 | Ilias Diakonikolas, Daniel M. Kane, Thanasis Pittas, Nikos Zarifis |
The Optimality of Polynomial Regression for Agnostic Learning under Gaussian Marginals in the SQ Model. |
COLT |
2021 |
DBLP BibTeX RDF |
|
| 1 | Dimitris Fotakis 0001, Alkis Kalavasis, Vasilis Kontonis, Christos Tzamos |
Efficient Algorithms for Learning from Coarse Labels. |
COLT |
2021 |
DBLP BibTeX RDF |
|
| 1 | Waïss Azizian, Franck Iutzeler, Jérôme Malick, Panayotis Mertikopoulos |
The Last-Iterate Convergence Rate of Optimistic Mirror Descent in Stochastic Variational Inequalities. |
COLT |
2021 |
DBLP BibTeX RDF |
|
| 1 | Andrew G. Lamperski |
Projected Stochastic Gradient Langevin Algorithms for Constrained Sampling and Non-Convex Learning. |
COLT |
2021 |
DBLP BibTeX RDF |
|
| 1 | Omar Besbes, Yuri Fonseca, Ilan Lobel |
Online Learning from Optimal Actions. |
COLT |
2021 |
DBLP BibTeX RDF |
|
| 1 | Wei-Ning Chen, Peter Kairouz, Ayfer Özgür |
Breaking The Dimension Dependence in Sparse Distribution Estimation under Communication Constraints. |
COLT |
2021 |
DBLP BibTeX RDF |
|
| 1 | Saeed Masoudian, Yevgeny Seldin |
Improved Analysis of the Tsallis-INF Algorithm in Stochastically Constrained Adversarial Bandits and Stochastic Bandits with Adversarial Corruptions. |
COLT |
2021 |
DBLP BibTeX RDF |
|
| 1 | Jeff Z. HaoChen, Colin Wei, Jason D. Lee, Tengyu Ma 0001 |
Shape Matters: Understanding the Implicit Bias of the Noise Covariance. |
COLT |
2021 |
DBLP BibTeX RDF |
|
| 1 | Meir Feder, Yury Polyanskiy |
Sequential prediction under log-loss and misspecification. |
COLT |
2021 |
DBLP BibTeX RDF |
|
| 1 | Tor Lattimore, András György 0001 |
Improved Regret for Zeroth-Order Stochastic Convex Bandits. |
COLT |
2021 |
DBLP BibTeX RDF |
|
| 1 | Xi Chen 0001, Rajesh Jayaram, Amit Levi, Erik Waingarten |
Learning and testing junta distributions with sub cube conditioning. |
COLT |
2021 |
DBLP BibTeX RDF |
|
| 1 | Daniel Russo 0001, Assaf Zeevi, Tianyi Zhang |
Learning to Stop with Surprisingly Few Samples. |
COLT |
2021 |
DBLP BibTeX RDF |
|
| 1 | Orestis Plevrakis |
Learning from Censored and Dependent Data: The case of Linear Dynamics. |
COLT |
2021 |
DBLP BibTeX RDF |
|
| 1 | Yair Ashlagi, Lee-Ad Gottlieb, Aryeh Kontorovich |
Functions with average smoothness: structure, algorithms, and learning. |
COLT |
2021 |
DBLP BibTeX RDF |
|
| 1 | Avrim Blum, Steve Hanneke, Jian Qian, Han Shao |
Robust learning under clean-label attack. |
COLT |
2021 |
DBLP BibTeX RDF |
|
| 1 | Yi Li 0002, David P. Woodruff, Taisuke Yasuda 0002 |
Exponentially Improved Dimensionality Reduction for l1: Subspace Embeddings and Independence Testing. |
COLT |
2021 |
DBLP BibTeX RDF |
|
| 1 | De Huang, Jonathan Niles-Weed, Rachel A. Ward |
Streaming k-PCA: Efficient guarantees for Oja's algorithm, beyond rank-one updates. |
COLT |
2021 |
DBLP BibTeX RDF |
|
| 1 | Alon Cohen, Haim Kaplan, Tomer Koren, Yishay Mansour |
Online Markov Decision Processes with Aggregate Bandit Feedback. |
COLT |
2021 |
DBLP BibTeX RDF |
|
| 1 | Marco Bressan 0002, Nicolò Cesa-Bianchi, Silvio Lattanzi, Andrea Paudice |
Exact Recovery of Clusters in Finite Metric Spaces Using Oracle Queries. |
COLT |
2021 |
DBLP BibTeX RDF |
|
| 1 | Dylan J. Foster, Akshay Krishnamurthy, Haipeng Luo |
Open Problem: Model Selection for Contextual Bandits. |
COLT |
2020 |
DBLP BibTeX RDF |
|
| 1 | Tianyi Lin, Chi Jin 0001, Michael I. Jordan |
Near-Optimal Algorithms for Minimax Optimization. |
COLT |
2020 |
DBLP BibTeX RDF |
|
| 1 | Max Hopkins, Daniel Kane 0001, Shachar Lovett, Gaurav Mahajan |
Noise-tolerant, Reliable Active Classification with Comparison Queries. |
COLT |
2020 |
DBLP BibTeX RDF |
|
| 1 | Olivier Bousquet, Steve Hanneke, Shay Moran, Nikita Zhivotovskiy |
Proper Learning, Helly Number, and an Optimal SVM Bound. |
COLT |
2020 |
DBLP BibTeX RDF |
|
| 1 | Gil Kur, Alexander Rakhlin, Adityanand Guntuboyina |
On Suboptimality of Least Squares with Application to Estimation of Convex Bodies. |
COLT |
2020 |
DBLP BibTeX RDF |
|
| 1 | Paxton Turner, Raghu Meka, Philippe Rigollet |
Balancing Gaussian vectors in high dimension. |
COLT |
2020 |
DBLP BibTeX RDF |
|
| 1 | Hunter Chase, James Freitag |
Bounds in query learning. |
COLT |
2020 |
DBLP BibTeX RDF |
|
| 1 | Soham Jana, Yury Polyanskiy, Yihong Wu 0001 |
Extrapolating the profile of a finite population. |
COLT |
2020 |
DBLP BibTeX RDF |
|
| 1 | Ankur Moitra, Elchanan Mossel, Colin Sandon |
Parallels Between Phase Transitions and Circuit Complexity? |
COLT |
2020 |
DBLP BibTeX RDF |
|
| 1 | Sébastien Bubeck, Dan Mikulincer |
How to Trap a Gradient Flow. |
COLT |
2020 |
DBLP BibTeX RDF |
|
| 1 | Cédric Gerbelot, Alia Abbara, Florent Krzakala |
Asymptotic Errors for High-Dimensional Convex Penalized Linear Regression beyond Gaussian Matrices. |
COLT |
2020 |
DBLP BibTeX RDF |
|
| 1 | Ziwei Ji, Miroslav Dudík, Robert E. Schapire, Matus Telgarsky |
Gradient descent follows the regularization path for general losses. |
COLT |
2020 |
DBLP BibTeX RDF |
|
| 1 | Jayadev Acharya, Clément L. Canonne, Yanjun Han, Ziteng Sun, Himanshu Tyagi |
Domain Compression and its Application to Randomness-Optimal Distributed Goodness-of-Fit. |
COLT |
2020 |
DBLP BibTeX RDF |
|
| 1 | Allen Liu, Ankur Moitra |
Better Algorithms for Estimating Non-Parametric Models in Crowd-Sourcing and Rank Aggregation. |
COLT |
2020 |
DBLP BibTeX RDF |
|
| 1 | James P. Bailey, Gauthier Gidel, Georgios Piliouras |
Finite Regret and Cycles with Fixed Step-Size via Alternating Gradient Descent-Ascent. |
COLT |
2020 |
DBLP BibTeX RDF |
|
| 1 | Kareem Amin 0002, Matthew Joseph, Jieming Mao |
Pan-Private Uniformity Testing. |
COLT |
2020 |
DBLP BibTeX RDF |
|
| 1 | Yingyu Liang, Hui Yuan |
Learning Entangled Single-Sample Gaussians in the Subset-of-Signals Model. |
COLT |
2020 |
DBLP BibTeX RDF |
|
| 1 | Qiaomin Xie, Yudong Chen 0001, Zhaoran Wang 0001, Zhuoran Yang |
Learning Zero-Sum Simultaneous-Move Markov Games Using Function Approximation and Correlated Equilibrium. |
COLT |
2020 |
DBLP BibTeX RDF |
|
| 1 | Max Simchowitz, Karan Singh, Elad Hazan |
Improper Learning for Non-Stochastic Control. |
COLT |
2020 |
DBLP BibTeX RDF |
|
| 1 | Vladimir A. Kobzar, Robert V. Kohn, Zhilei Wang |
New Potential-Based Bounds for Prediction with Expert Advice. |
COLT |
2020 |
DBLP BibTeX RDF |
|
| 1 | Brian Bullins |
Highly smooth minimization of non-smooth problems. |
COLT |
2020 |
DBLP BibTeX RDF |
|
| 1 | Johannes Kirschner, Tor Lattimore, Andreas Krause 0001 |
Information Directed Sampling for Linear Partial Monitoring. |
COLT |
2020 |
DBLP BibTeX RDF |
|
| 1 | Prasad Raghavendra, Morris Yau |
List Decodable Subspace Recovery. |
COLT |
2020 |
DBLP BibTeX RDF |
|
| 1 | Kefan Dong, Jian Peng 0001, Yining Wang, Yuan Zhou 0007 |
Root-n-Regret for Learning in Markov Decision Processes with Function Approximation and Low Bellman Rank. |
COLT |
2020 |
DBLP BibTeX RDF |
|
| 1 | Haim Kaplan, Katrina Ligett, Yishay Mansour, Moni Naor, Uri Stemmer |
Privately Learning Thresholds: Closing the Exponential Gap. |
COLT |
2020 |
DBLP BibTeX RDF |
|
| 1 | Noah Golowich, Sarath Pattathil, Constantinos Daskalakis, Asuman E. Ozdaglar |
Last Iterate is Slower than Averaged Iterate in Smooth Convex-Concave Saddle Point Problems. |
COLT |
2020 |
DBLP BibTeX RDF |
|
| 1 | Mark Bun, Marco Leandro Carmosino, Jessica Sorrell |
Efficient, Noise-Tolerant, and Private Learning via Boosting. |
COLT |
2020 |
DBLP BibTeX RDF |
|
| 1 | Noga Alon, Yossi Azar, Danny Vainstein |
Hierarchical Clustering: A 0.585 Revenue Approximation. |
COLT |
2020 |
DBLP BibTeX RDF |
|
| 1 | Yossi Arjevani, Yair Carmon, John C. Duchi, Dylan J. Foster, Ayush Sekhari, Karthik Sridharan |
Second-Order Information in Non-Convex Stochastic Optimization: Power and Limitations. |
COLT |
2020 |
DBLP BibTeX RDF |
|
| 1 | Tengyuan Liang, Alexander Rakhlin, Xiyu Zhai |
On the Multiple Descent of Minimum-Norm Interpolants and Restricted Lower Isometry of Kernels. |
COLT |
2020 |
DBLP BibTeX RDF |
|
| 1 | Blake E. Woodworth, Suriya Gunasekar, Jason D. Lee, Edward Moroshko, Pedro Savarese, Itay Golan, Daniel Soudry, Nathan Srebro |
Kernel and Rich Regimes in Overparametrized Models. |
COLT |
2020 |
DBLP BibTeX RDF |
|
| 1 | Chen-Yu Wei, Haipeng Luo, Alekh Agarwal |
Taking a hint: How to leverage loss predictors in contextual bandits? |
COLT |
2020 |
DBLP BibTeX RDF |
|
![[Valid RSS]](Pics/valid-rss.png "Validate my RSS feed")
data released under the ODC-BY 1.0 license