default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDSearch 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 1,170 matches
- 2024
- Hang Liao, Deeparnab Chakrabarty:
Learning Spanning Forests Optimally in Weighted Undirected Graphs with CUT queries. ALT 2024: 785-807 - Jacob D. Abernethy, Alekh Agarwal, Teodor Vanislavov Marinov, Manfred K. Warmuth:
A Mechanism for Sample-Efficient In-Context Learning for Sparse Retrieval Tasks. ALT 2024: 3-46 - Mohammad Afzali, Hassan Ashtiani, Christopher Liaw:
Mixtures of Gaussians are Privately Learnable with a Polynomial Number of Samples. ALT 2024: 47-73 - Shubhada Agrawal, Timothée Mathieu, Debabrota Basu, Odalric-Ambrym Maillard:
CRIMED: Lower and Upper Bounds on Regret for Bandits with Unbounded Stochastic Corruption. ALT 2024: 74-124 - Pranjal Awasthi, Satyen Kale, Ankit Pensia:
Semi-supervised Group DRO: Combating Sparsity with Unlabeled Data. ALT 2024: 125-160 - Oliver Biggar, Iman Shames:
The Attractor of the Replicator Dynamic in Zero-Sum Games. ALT 2024: 161-178 - Moïse Blanchard, Václav Vorácek:
Tight Bounds for Local Glivenko-Cantelli. ALT 2024: 179-220 - Avrim Blum, Meghal Gupta, Gene Li, Naren Sarayu Manoj
, Aadirupa Saha, Yuanyuan Yang:
Dueling Optimization with a Monotone Adversary. ALT 2024: 221-243 - William Brown, Arpit Agarwal:
Online Recommendations for Agents with Discounted Adaptive Preferences. ALT 2024: 244-281 - Tristan Brugère, Zhengchao Wan, Yusu Wang:
Distances for Markov Chains, and Their Differentiation. ALT 2024: 282-336 - Victor-Emmanuel Brunel, Jordan Serres:
Concentration of empirical barycenters in metric spaces. ALT 2024: 337-361 - Mark Bun, Gautam Kamath, Argyris Mouzakis, Vikrant Singhal:
Not All Learnable Distribution Classes are Privately Learnable. ALT 2024: 390-401 - Mark Bun, Aloni Cohen, Rathin Desai:
Private PAC Learning May be Harder than Online Learning. ALT 2024: 362-389 - Davin Choo, Joy Qiping Yang, Arnab Bhattacharyya, Clément L. Canonne:
Learning bounded-degree polytrees with known skeleton. ALT 2024: 402-443 - Lorenzo Croissant, Marc Abeille, Bruno Bouchard:
Near-continuous time Reinforcement Learning for continuous state-action spaces. ALT 2024: 444-498 - Max Dabagia, Christos H. Papadimitriou, Santosh S. Vempala:
Computation with Sequences of Assemblies in a Model of the Brain. ALT 2024: 499-504 - Amit Daniely, Elad Granot:
On the Sample Complexity of Two-Layer Networks: Lipschitz Vs. Element-Wise Lipschitz Activation. ALT 2024: 505-517 - Amit Daniely, Mariano Schain, Gilad Yehudai:
RedEx: Beyond Fixed Representation Methods via Convex Optimization. ALT 2024: 518-543 - Pramith Devulapalli, Steve Hanneke:
The Dimension of Self-Directed Learning. ALT 2024: 544-573 - Shaun M. Fallat, Valerii Maliuk, Seyed Ahmad Mojallal, Sandra Zilles:
Learning Hypertrees From Shortest Path Queries. ALT 2024: 574-589 - Nave Frost, Zachary C. Lipton, Yishay Mansour, Michal Moshkovitz:
Partially Interpretable Models with Guarantees on Coverage and Accuracy. ALT 2024: 590-613 - Germano Gabbianelli, Gergely Neu, Matteo Papini:
Importance-Weighted Offline Learning Done Right. ALT 2024: 614-634 - Steve Hanneke, Aryeh Kontorovich, Guy Kornowski:
Efficient Agnostic Learning with Average Smoothness. ALT 2024: 719-731 - Amin Karbasi, Kasper Green Larsen:
The Impossibility of Parallelizing Boosting. ALT 2024: 635-653 - Ari Karchmer:
Agnostic Membership Query Learning with Nontrivial Savings: New Results and Techniques. ALT 2024: 654-682 - Ian A. Kash, Lev Reyzin, Zishun Yu:
Slowly Changing Adversarial Bandit Algorithms are Efficient for Discounted MDPs. ALT 2024: 683-718 - Fangshuo Liao, Anastasios Kyrillidis:
Provable Accelerated Convergence of Nesterov's Momentum for Deep ReLU Neural Networks. ALT 2024: 732-784 - Zhou Lu:
On the Computational Benefit of Multimodal Learning. ALT 2024: 810-821 - Anqi Mao, Mehryar Mohri, Yutao Zhong:
Predictor-Rejector Multi-Class Abstention: Theoretical Analysis and Algorithms. ALT 2024: 822-867 - Michael Menart, Enayat Ullah, Raman Arora, Raef Bassily, Cristóbal Guzmán:
Differentially Private Non-Convex Optimization under the KL Condition with Optimal Rates. ALT 2024: 868-906
skipping 1,140 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-11-19 14:31 CET 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
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
