• 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 52 matches

• 2013
• 
  Ittai Abraham, Omar Alonso, Vasilis Kandylas, Aleksandrs Slivkins:
  Adaptive Crowdsourcing Algorithms for the Bandit Survey Problem. COLT 2013: 882-910
• 
  Jayadev Acharya, Ashkan Jafarpour, Alon Orlitsky, Ananda Theertha Suresh:
  Optimal Probability Estimation with Applications to Prediction and Classification. COLT 2013: 764-796
• 
  Shivani Agarwal:
  Surrogate Regret Bounds for the Area Under the ROC Curve via Strongly Proper Losses. COLT 2013: 338-353
• 
  Animashree Anandkumar, Rong Ge, Daniel J. Hsu, Sham M. Kakade:
  A Tensor Spectral Approach to Learning Mixed Membership Community Models. COLT 2013: 867-881
• 
  Oren Anava, Elad Hazan, Shie Mannor, Ohad Shamir:
  Online Learning for Time Series Prediction. COLT 2013: 172-184
• 
  Joseph Anderson, Navin Goyal, Luis Rademacher:
  Efficient Learning of Simplices. COLT 2013: 1020-1045
• 
  Lachlan L. H. Andrew, Siddharth Barman, Katrina Ligett, Minghong Lin, Adam Meyerson, Alan Roytman, Adam Wierman:
  A Tale of Two Metrics: Simultaneous Bounds on Competitiveness and Regret. COLT 2013: 741-763
• 
  Pranjal Awasthi, Vitaly Feldman, Varun Kanade:
  Learning Using Local Membership Queries. COLT 2013: 398-431
• 
  Francis R. Bach:
  Sharp analysis of low-rank kernel matrix approximations. COLT 2013: 185-209
• 
  Maria-Florina Balcan, Philip M. Long:
  Active and passive learning of linear separators under log-concave distributions. COLT 2013: 288-316
• 
  Peter L. Bartlett, Peter Grünwald, Peter Harremoës, Fares Hedayati, Wojciech Kotlowski:
  Horizon-Independent Optimal Prediction with Log-Loss in Exponential Families. COLT 2013: 639-661
• 
  Gábor Bartók:
  A near-optimal algorithm for finite partial-monitoring games against adversarial opponents. COLT 2013: 696-710
• 
  Mikhail Belkin, Luis Rademacher, James R. Voss:
  Blind Signal Separation in the Presence of Gaussian Noise. COLT 2013: 270-287
• 
  Andrey Bernstein, Shie Mannor, Nahum Shimkin:
  Opportunistic Strategies for Generalized No-Regret Problems. COLT 2013: 158-171
• 
  Quentin Berthet, Philippe Rigollet:
  Complexity Theoretic Lower Bounds for Sparse Principal Component Detection. COLT 2013: 1046-1066
• 
  Sébastien Bubeck, Vianney Perchet, Philippe Rigollet:
  Bounded regret in stochastic multi-armed bandits. COLT 2013: 122-134
• 
  Chao-Kai Chiang, Chia-Jung Lee, Chi-Jen Lu:
  Beating Bandits in Gradually Evolving Worlds. COLT 2013: 210-227
• 
  Sung-Soon Choi:
  Polynomial Time Optimal Query Algorithms for Finding Graphs with Arbitrary Real Weights. COLT 2013: 797-818
• 
  Amit Daniely, Tom Helbertal:
  The price of bandit information in multiclass online classification. COLT 2013: 93-104
• 
  Sanjoy Dasgupta, Kaushik Sinha:
  Randomized partition trees for exact nearest neighbor search. COLT 2013: 317-337
• 
  Luc Devroye, Gábor Lugosi, Gergely Neu:
  Prediction by random-walk perturbation. COLT 2013: 460-473
• 
  Vitaly Feldman, Pravesh Kothari, Jan Vondrák:
  Representation, Approximation and Learning of Submodular Functions Using Low-rank Decision Trees. COLT 2013: 711-740
• 
  Claudio Gentile, Mark Herbster, Stephen Pasteris:
  Online Similarity Prediction of Networked Data from Known and Unknown Graphs. COLT 2013: 662-695
• 
  Eyal Gofer, Nicolò Cesa-Bianchi, Claudio Gentile, Yishay Mansour:
  Regret Minimization for Branching Experts. COLT 2013: 618-638
• 
  Wei Han, Alexander Rakhlin, Karthik Sridharan:
  Competing With Strategies. COLT 2013: 966-992
• 
  Moritz Hardt, Ankur Moitra:
  Algorithms and Hardness for Robust Subspace Recovery. COLT 2013: 354-375
• 
  Marcus Hutter:
  Sparse Adaptive Dirichlet-Multinomial-like Processes. COLT 2013: 432-459
• 
  Daniel M. Kane, Adam R. Klivans, Raghu Meka:
  Learning Halfspaces Under Log-Concave Densities: Polynomial Approximations and Moment Matching. COLT 2013: 522-545
• 
  Emilie Kaufmann, Shivaram Kalyanakrishnan:
  Information Complexity in Bandit Subset Selection. COLT 2013: 228-251
• 
  Wouter M. Koolen, Jiazhong Nie, Manfred K. Warmuth:
  Learning a set of directions. COLT 2013: 851-866

skipping 22 more matches