• 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.

found 39 matches

• 2019
• 
  Hasan Abasi, Nader H. Bshouty:
  On Learning Graphs with Edge-Detecting Queries. ALT 2019: 3-30
• 
  Karim T. Abou-Moustafa, Csaba Szepesvári:
  An Exponential Efron-Stein Inequality for L_q Stable Learning Rules. ALT 2019: 31-63
• 
  Mastane Achab, Anna Korba, Stéphan Clémençon:
  Dimensionality Reduction and (Bucket) Ranking: a Mass Transportation Approach. ALT 2019: 64-93
• 
  Juliette Achdou, Joseph Lam-Weil, Alexandra Carpentier, Gilles Blanchard:
  A minimax near-optimal algorithm for adaptive rejection sampling. ALT 2019: 94-126
• 
  Alexandr Andoni, Rishabh Dudeja, Daniel Hsu, Kiran Vodrahalli:
  Attribute-efficient learning of monomials over highly-correlated variables. ALT 2019: 127-161
• 
  Idan Attias, Aryeh Kontorovich, Yishay Mansour:
  Improved Generalization Bounds for Robust Learning. ALT 2019: 162-183
• 
  Peter L. Bartlett, Victor Gabillon, Michal Valko:
  A simple parameter-free and adaptive approach to optimization under a minimal local smoothness assumption. ALT 2019: 184-206
• 
  Nader H. Bshouty, Catherine A. Haddad-Zaknoon:
  Adaptive Exact Learning of Decision Trees from Membership Queries. ALT 2019: 207-234
• 
  Brian Bullins, Elad Hazan, Adam Kalai, Roi Livni:
  Generalize Across Tasks: Efficient Algorithms for Linear Representation Learning. ALT 2019: 235-246
• 
  Nicolò Cesa-Bianchi, Tommaso Cesari, Vianney Perchet:
  Dynamic Pricing with Finitely Many Unknown Valuations. ALT 2019: 247-273
• 
  Corinna Cortes, Vitaly Kuznetsov, Mehryar Mohri, Holakou Rahmanian, Manfred K. Warmuth:
  Online Non-Additive Path Learning under Full and Partial Information. ALT 2019: 274-299
• 
  Andrew Cotter, Heinrich Jiang, Karthik Sridharan:
  Two-Player Games for Efficient Non-Convex Constrained Optimization. ALT 2019: 300-332
• 
  Amit Daniely, Yishay Mansour:
  Competitive ratio vs regret minimization: achieving the best of both worlds. ALT 2019: 333-368
• 
  Alexander Durgin, Brendan Juba:
  Hardness of Improper One-Sided Learning of Conjunctions For All Uniformly Falsifiable CSPs. ALT 2019: 369-382
• 
  Ekaterina B. Fokina, Timo Kötzing, Luca San Mauro:
  Limit Learning Equivalence Structures. ALT 2019: 383-403
• 
  Pierre Gaillard, Sébastien Gerchinovitz, Malo Huard, Gilles Stoltz:
  Uniform regret bounds over R^d for the sequential linear regression problem with the square loss. ALT 2019: 404-432
• 
  Aurélien Garivier, Satyen Kale:
  Algorithmic Learning Theory 2019: Preface. ALT 2019: 1-2
• 
  Peter D. Grünwald, Nishant A. Mehta:
  A tight excess risk bound via a unified PAC-Bayesian-Rademacher-Shtarkov-MDL complexity. ALT 2019: 433-465
• 
  Steve Hanneke, Aryeh Kontorovich:
  A Sharp Lower Bound for Agnostic Learning with Sample Compression Schemes. ALT 2019: 489-505
• 
  Steve Hanneke, Aryeh Kontorovich, Menachem Sadigurschi:
  Sample Compression for Real-Valued Learners. ALT 2019: 466-488
• 
  David G. Kirkpatrick, Hans Ulrich Simon, Sandra Zilles:
  Optimal Collusion-Free Teaching. ALT 2019: 506-528
• 
  Tor Lattimore, Csaba Szepesvári:
  Cleaning up the neighborhood: A full classification for adversarial partial monitoring. ALT 2019: 529-556
• 
  Gábor Lugosi, Gergely Neu, Julia Olkhovskaya:
  Online Influence Maximization with Local Observations. ALT 2019: 557-580
• 
  Saeed Mahloujifar, Mohammad Mahmoody:
  Can Adversarially Robust Learning LeverageComputational Hardness? ALT 2019: 581-609
• 
  Odalric-Ambrym Maillard:
  Sequential change-point detection: Laplace concentration of scan statistics and non-asymptotic delay bounds. ALT 2019: 610-632
• 
  Ido Nachum, Amir Yehudayoff:
  Average-Case Information Complexity of Learning. ALT 2019: 633-646
• 
  Mohamed Ndaoud:
  Interplay of minimax estimation and minimax support recovery under sparsity. ALT 2019: 647-668
• 
  Frank Nussbaum, Joachim Giesen:
  Ising Models with Latent Conditional Gaussian Variables. ALT 2019: 669-681
• 
  Henry W. J. Reeve, Ata Kabán:
  Exploiting geometric structure in mixture proportion estimation with generalised Blanchard-Lee-Scott estimators. ALT 2019: 682-699
• 
  Aadirupa Saha, Aditya Gopalan:
  PAC Battling Bandits in the Plackett-Luce Model. ALT 2019: 700-737

skipping 9 more matches