![](https://dblp1.uni-trier.de/img/logo.ua.320x120.png)
![](https://dblp1.uni-trier.de/img/dropdown.dark.16x16.png)
![](https://dblp1.uni-trier.de/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp1.uni-trier.de/img/search.dark.16x16.png)
![search dblp](https://dblp1.uni-trier.de/img/search.dark.16x16.png)
default search action
Search dblp
Full-text search
- > Home
Please enter a search query
- case-insensitive prefix search: default
e.g., sig matches "SIGIR" as well as "signal" - exact word search: append dollar sign ($) to word
e.g., graph$ matches "graph", but not "graphics" - boolean and: separate words by space
e.g., codd model - boolean or: connect words by pipe symbol (|)
e.g., graph|network
Update May 7, 2017: Please note that we had to disable the phrase search operator (.) and the boolean not operator (-) due to technical problems. For the time being, phrase search queries will yield regular prefix search result, and search terms preceded by a minus will be interpreted as regular (positive) search terms.
Author search results
no matches
Venue search results
no matches
Refine list
refine by author
- no options
- temporarily not available
refine by venue
- no options
- temporarily not available
refine by type
- no options
- temporarily not available
refine by access
- no options
- temporarily not available
refine by year
- no options
- temporarily not available
Publication search results
found 141 matches
- 2021
- Christopher Jung, Changhwa Lee, Mallesh M. Pai, Aaron Roth, Rakesh Vohra:
Moment Multicalibration for Uncertainty Estimation. COLT 2021: 2634-2678 - Pan Peng, Jiapeng Zhang:
Towards a Query-Optimal and Time-Efficient Algorithm for Clustering with a Faulty Oracle. COLT 2021: 3662-3680 - Daniel Russo, Assaf Zeevi, Tianyi Zhang:
Learning to Stop with Surprisingly Few Samples. COLT 2021: 3887-3888 - Marco Bressan, Nicolò Cesa-Bianchi, Silvio Lattanzi, Andrea Paudice:
Exact Recovery of Clusters in Finite Metric Spaces Using Oracle Queries. COLT 2021: 775-803 - Gen Li, Yuting Wei, Yuejie Chi, Yuantao Gu, Yuxin Chen:
Softmax Policy Gradient Methods Can Take Exponential Time to Converge. COLT 2021: 3107-3110 - Emmanuel Abbe, Elisabetta Cornacchia, Yuzhou Gu, Yury Polyanskiy:
Stochastic block model entropy and broadcasting on trees with survey. COLT 2021: 1-25 - Sushant Agarwal, Nivasini Ananthakrishnan, Shai Ben-David, Tosca Lechner, Ruth Urner:
Open Problem: Are all VC-classes CPAC learnable? COLT 2021: 4636-4641 - Shubhada Agrawal, Sandeep Juneja, Wouter M. Koolen:
Regret Minimization in Heavy-Tailed Bandits. COLT 2021: 26-62 - Idan Amir, Tomer Koren, Roi Livni:
SGD Generalizes Better Than GD (And Regularization Doesn't Help). COLT 2021: 63-92 - Nima Anari, Moses Charikar, Kirankumar Shiragur, Aaron Sidford:
The Bethe and Sinkhorn Permanents of Low Rank Matrices and Implications for Profile Maximum Likelihood. COLT 2021: 93-158 - Gabriel P. Andrade, Rafael M. Frongillo, Georgios Piliouras:
Learning in Matrix Games can be Arbitrarily Complex. COLT 2021: 159-185 - Yair Ashlagi, Lee-Ad Gottlieb, Aryeh Kontorovich:
Functions with average smoothness: structure, algorithms, and learning. COLT 2021: 186-236 - Pranjal Awasthi, Vaggos Chatziafratis, Xue Chen, Aravindan Vijayaraghavan:
Adversarially Robust Low Dimensional Representations. COLT 2021: 237-325 - 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: 326-358 - Dheeraj Baby, Yu-Xiang Wang:
Optimal Dynamic Regret in Exp-Concave Online Learning. COLT 2021: 359-409 - Afonso S. Bandeira, Jess Banks, Dmitriy Kunisky, Cristopher Moore, Alexander S. Wein:
Spectral Planting and the Hardness of Refuting Cuts, Colorability, and Communities in Random Graphs. COLT 2021: 410-473 - Raef Bassily, Cristóbal Guzmán, Anupama Nandi:
Non-Euclidean Differentially Private Stochastic Convex Optimization. COLT 2021: 474-499 - Huck Bennett, Anindya De, Rocco A. Servedio, Emmanouil-Vasileios Vlatakis-Gkaragkounis
:
Reconstructing weighted voting schemes from partial information about their power indices. COLT 2021: 500-565 - Tomer Berg, Or Ordentlich, Ofer Shayevitz:
Deterministic Finite-Memory Bias Estimation. COLT 2021: 566-585 - Omar Besbes, Yuri Fonseca, Ilan Lobel:
Online Learning from Optimal Actions. COLT 2021: 586 - Adam Block, Yuval Dagan, Alexander Rakhlin:
Majorizing Measures, Sequential Complexities, and Online Learning. COLT 2021: 587-590 - Avrim Blum, Steve Hanneke, Jian Qian, Han Shao:
Robust learning under clean-label attack. COLT 2021: 591-634 - Antoine Bodin, Nicolas Macris:
Rank-one matrix estimation: analytic time evolution of gradient descent dynamics. COLT 2021: 635-678 - Simina Brânzei, Yuval Peres:
Multiplayer Bandit Learning, from Competition to Cooperation. COLT 2021: 679-723 - Vladimir Braverman, Robert Krauthgamer, Aditya Krishnan, Shay Sapir:
Near-Optimal Entrywise Sampling of Numerically Sparse Matrices. COLT 2021: 759-773 - Mark Braverman, Gillat Kol, Shay Moran, Raghuvansh R. Saxena:
Near Optimal Distributed Learning of Halfspaces with Two Parties. COLT 2021: 724-758 - Matthew S. Brennan, Guy Bresler, Samuel B. Hopkins, Jerry Li, Tselil Schramm:
Statistical Query Algorithms and Low Degree Tests Are Almost Equivalent. COLT 2021: 774 - Sébastien Bubeck, Thomas Budzinski, Mark Sellke:
Cooperative and Stochastic Multi-Player Multi-Armed Bandit: Optimal Regret With Neither Communication Nor Collisions. COLT 2021: 821-822 - Sébastien Bubeck, Yuanzhi Li, Dheeraj M. Nagaraj:
A Law of Robustness for Two-Layers Neural Networks. COLT 2021: 804-820 - Vivien A. Cabannes, Francis R. Bach, Alessandro Rudi:
Fast Rates for Structured Prediction. COLT 2021: 823-865
skipping 111 more matches
loading more results
failed to load more results, please try again later
![](https://dblp1.uni-trier.de/img/cog.dark.24x24.png)
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
retrieved on 2024-07-12 00:55 CEST from data curated by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint