Остановите войну!
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 71 matches
- 2016
- Shipra Agrawal, Nikhil R. Devanur, Lihong Li:
An efficient algorithm for contextual bandits with knapsacks, and an extension to concave objectives. COLT 2016: 4-18 - Ahmed El Alaoui:
Asymptotic behavior of \(\ell_p\)-based Laplacian regularization in semi-supervised learning. COLT 2016: 879-906 - Maryam Aliakbarpour, Eric Blais, Ronitt Rubinfeld:
Learning and Testing Junta Distributions. COLT 2016: 19-46 - Noga Alon, Shay Moran, Amir Yehudayoff:
Sign rank versus VC dimension. COLT 2016: 47-80 - Animashree Anandkumar, Rong Ge:
Efficient approaches for escaping higher order saddle points in non-convex optimization. COLT 2016: 81-102 - Nima Anari, Shayan Oveis Gharan, Alireza Rezaei:
Monte Carlo Markov Chain Algorithms for Sampling Strongly Rayleigh Distributions and Determinantal Point Processes. COLT 2016: 103-115 - Peter Auer, Chao-Kai Chiang:
An algorithm with nearly optimal pseudo-regret for both stochastic and adversarial bandits. COLT 2016: 116-120 - Pranjal Awasthi, Maria-Florina Balcan, Nika Haghtalab, Hongyang Zhang:
Learning and 1-bit Compressed Sensing under Asymmetric Noise. COLT 2016: 152-192 - Kamyar Azizzadenesheli, Alessandro Lazaric, Animashree Anandkumar:
Reinforcement Learning of POMDPs using Spectral Methods. COLT 2016: 193-256 - Kamyar Azizzadenesheli, Alessandro Lazaric, Animashree Anandkumar:
Open Problem: Approximate Planning of POMDPs in the class of Memoryless Policies. COLT 2016: 1639-1642 - Francis R. Bach, Vianney Perchet:
Highly-Smooth Zero-th Order Online Optimization. COLT 2016: 257-283 - Maria-Florina Balcan, Simon Shaolei Du, Yining Wang, Adams Wei Yu:
An Improved Gap-Dependency Analysis of the Noisy Power Method. COLT 2016: 284-309 - Maria-Florina Balcan, Ellen Vitercik, Colin White:
Learning Combinatorial Functions from Pairwise Comparisons. COLT 2016: 310-335 - Akshay Balsubramani, Zohar S. Karnin, Robert E. Schapire, Masrour Zoghi:
Instance-dependent Regret Bounds for Dueling Bandits. COLT 2016: 336-360 - Afonso S. Bandeira, Nicolas Boumal, Vladislav Voroninski:
On the low-rank approach for semidefinite programs arising in synchronization and community detection. COLT 2016: 361-382 - Jess Banks, Cristopher Moore, Joe Neeman, Praneeth Netrapalli:
Information-theoretic thresholds for community detection in sparse networks. COLT 2016: 383-416 - Boaz Barak, Ankur Moitra:
Noisy Tensor Completion via the Sum-of-Squares Hierarchy. COLT 2016: 417-445 - Mikhail Belkin, Luis Rademacher, James R. Voss:
Basis Learning as an Algorithmic Primitive. COLT 2016: 446-487 - Pierre C. Bellec:
Aggregation of supports along the Lasso path. COLT 2016: 488-529 - Srinadh Bhojanapalli, Anastasios Kyrillidis, Sujay Sanghavi:
Dropping Convexity for Faster Semi-definite Optimization. COLT 2016: 530-582 - Sébastien Bubeck, Ronen Eldan:
Multi-scale exploration of convex functions and bandit convex optimization. COLT 2016: 583-589 - Alexandra Carpentier, Andrea Locatelli:
Tight (Lower) Bounds for the Fixed Budget Best Arm Identification Bandit Problem. COLT 2016: 590-604 - Nicolò Cesa-Bianchi, Claudio Gentile, Yishay Mansour, Alberto Minora:
Delay and Cooperation in Nonstochastic Bandits. COLT 2016: 605-622 - Siu On Chan, Dimitris Papailliopoulos, Aviad Rubinstein:
On the Approximability of Sparse PCA. COLT 2016: 623-646 - Lijie Chen, Anupam Gupta, Jian Li:
Pure Exploration of Multi-armed Bandit Under Matroid Constraints. COLT 2016: 647-669 - Lijie Chen, Jian Li:
Open Problem: Best Arm Identification: Almost Instance-Wise Optimality and the Gap Entropy Conjecture. COLT 2016: 1643-1646 - Paul F. Christiano:
Provably manipulation-resistant reputation systems. COLT 2016: 670-697 - Nadav Cohen, Or Sharir, Amnon Shashua:
On the Expressive Power of Deep Learning: A Tensor Analysis. COLT 2016: 698-728 - Andrew Cotter, Maya R. Gupta, Jan Pfeifer:
A Light Touch for Heavily Constrained SGD. COLT 2016: 729-771 - Rachel Cummings, Katrina Ligett, Kobbi Nissim, Aaron Roth, Zhiwei Steven Wu:
Adaptive Learning with Robust Generalization Guarantees. COLT 2016: 772-814
skipping 41 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-30 00:40 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