


default search action
Theoretical Computer Science, Volume 808
Volume 808, February 2020
- Steve Hanneke, Lev Reyzin

:
Special issue on ALT 2017: Guest Editors' Introduction. 1 - Dana Angluin, Tyler Dohrn:

The power of random counterexamples. 2-13 - Maria-Florina Balcan, Avrim Blum, Vaishnavh Nagarajan:

Lifelong learning in costly feature spaces. 14-37 - Fahimeh Bayeh, Ziyuan Gao, Sandra Zilles:

Finitely distinguishable erasing pattern languages. 38-73 - Danielle Ensign, Scott Neville

, Arnab Paul, Suresh Venkatasubramanian
:
The complexity of explaining neural networks through (group) invariants. 74-85 - Vitaly Feldman, Pravesh Kothari, Jan Vondrák:

Tight bounds on ℓ1 approximation and learning of self-bounding functions. 86-98 - Arushi Gupta, Daniel Hsu:

Parameter identification in Markov chain choice models. 99-107 - Pooria Joulani, András György

, Csaba Szepesvári:
A modular analysis of adaptive (non-)convex optimization: Optimism, composite objectives, variance reduction, and variational bounds. 108-138 - Wojciech Kotlowski:

Scale-invariant unconstrained online learning. 139-158 - Philip M. Long:

New bounds on the price of bandit feedback for mistake-bounded online multiclass learning. 159-163

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.


Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID














