Остановите войну!
for scientists:
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 128 matches
- 2019
- Rong Ge, Prateek Jain, Sham M. Kakade, Rahul Kidambi, Dheeraj M. Nagaraj, Praneeth Netrapalli:
Open Problem: Do Good Algorithms Necessarily Query Bad Points? COLT 2019: 3190-3193 - Yu Cheng, Ilias Diakonikolas, Rong Ge, David P. Woodruff:
Faster Algorithms for High-Dimensional Robust Covariance Estimation. COLT 2019: 727-757 - Prateek Jain, Dheeraj Nagaraj, Praneeth Netrapalli:
Making the Last Iterate of SGD Information Theoretically Optimal. COLT 2019: 1752-1755 - Bo Jiang, Haoyue Wang, Shuzhong Zhang:
An Optimal High-Order Tensor Method for Convex Optimization. COLT 2019: 1799-1801 - Jayadev Acharya, Clément L. Canonne, Himanshu Tyagi:
Inference under Information Constraints: Lower Bounds from Chi-Square Contraction. COLT 2019: 3-17 - Naman Agarwal, Alon Gonen, Elad Hazan:
Learning in Non-convex Games with an Optimization Oracle. COLT 2019: 18-29 - Daniel Alabi, Adam Tauman Kalai, Katrina Ligett, Cameron Musco, Christos Tzamos, Ellen Vitercik:
Learning to Prune: Speeding up Repeated Computations. COLT 2019: 30-33 - Maryam Aliakbarpour, Ravi Kumar, Ronitt Rubinfeld:
Testing Mixtures of Discrete Distributions. COLT 2019: 83-114 - Maryam Aliakbarpour, Themis Gouleakis, John Peebles, Ronitt Rubinfeld, Anak Yodpinyanee:
Towards Testing Monotonicity of Distributions Over General Posets. COLT 2019: 34-82 - Andreas Anastasiou, Krishnakumar Balasubramanian, Murat A. Erdogdu:
Normal Approximation for Stochastic Gradient Descent via Non-Asymptotic Rates of Martingale CLT. COLT 2019: 115-137 - Peter Auer, Yifang Chen, Pratik Gajane, Chung-Wei Lee, Haipeng Luo, Ronald Ortner, Chen-Yu Wei:
Achieving Optimal Dynamic Regret for Non-stationary Bandits without Prior Information. COLT 2019: 159-163 - Peter Auer, Pratik Gajane, Ronald Ortner:
Adaptively Tracking the Best Bandit Arm with an Unknown Number of Distribution Changes. COLT 2019: 138-158 - Francis R. Bach, Kfir Y. Levy:
A Universal Algorithm for Variational Inequalities Adaptive to Smoothness and Noise. COLT 2019: 164-194 - Ainesh Bakshi, Rajesh Jayaram, David P. Woodruff:
Learning Two Layer Rectified Neural Networks in Polynomial Time. COLT 2019: 195-268 - Amos Beimel, Shay Moran, Kobbi Nissim, Uri Stemmer:
Private Center Points and Learning of Halfspaces. COLT 2019: 269-282 - Ivona Bezáková, Antonio Blanca, Zongchen Chen, Daniel Stefankovic, Eric Vigoda:
Lower bounds for testing graphical models: colorings and antiferromagnetic Ising models. COLT 2019: 283-298 - Aditya Bhaskara, Wai Ming Tai:
Approximate Guarantees for Dictionary Learning. COLT 2019: 299-317 - Olivier Bousquet, Daniel Kane, Shay Moran:
The Optimal Approximation Factor in Density Estimation. COLT 2019: 318-341 - Mark Braverman, Jieming Mao, Yuval Peres:
Sorted Top-k in Rounds. COLT 2019: 342-382 - Mark Braverman, Jieming Mao, Jon Schneider, S. Matthew Weinberg:
Multi-armed Bandit Problems with Strategic Arms. COLT 2019: 383-416 - Matthew S. Brennan, Guy Bresler:
Optimal Average-Case Reductions to Sparse PCA: From Weak Assumptions to Strong Hardness. COLT 2019: 469-470 - Matthew S. Brennan, Guy Bresler, Wasim Huleihel:
Universality of Computational Lower Bounds for Submatrix Detection. COLT 2019: 417-468 - Victor-Emmanuel Brunel:
Learning rates for Gaussian mixtures under group action. COLT 2019: 471-491 - Sébastien Bubeck, Qijia Jiang, Yin Tat Lee, Yuanzhi Li, Aaron Sidford:
Near-optimal method for highly smooth convex optimization. COLT 2019: 492-507 - Sébastien Bubeck, Yuanzhi Li, Haipeng Luo, Chen-Yu Wei:
Improved Path-length Regret Bounds for Bandits. COLT 2019: 508-528 - Róbert Busa-Fekete, Dimitris Fotakis, Balázs Szörényi, Manolis Zampetakis:
Optimal Learning of Mallows Block Model. COLT 2019: 529-532 - Daniele Calandriello, Luigi Carratino, Alessandro Lazaric, Michal Valko, Lorenzo Rosasco:
Gaussian Process Optimization with Adaptive Sketching: Scalable and No Regret. COLT 2019: 533-557 - Tongyi Cao, Akshay Krishnamurthy:
Disagreement-Based Combinatorial Pure Exploration: Sample Complexity Bounds and an Efficient Algorithm. COLT 2019: 558-588 - Yair Carmon, John C. Duchi, Aaron Sidford, Kevin Tian:
A Rank-1 Sketch for Matrix Multiplicative Weights. COLT 2019: 589-623 - Vaggos Chatziafratis, Tim Roughgarden, Joshua R. Wang:
On the Computational Power of Online Gradient Descent. COLT 2019: 624-662
skipping 98 more matches
loading more results
failed to load more results, please try again later
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-05-05 06:05 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