[edit]
Volume 76: International Conference on Algorithmic Learning Theory, 15-17 October 2017, Kyoto University, Kyoto, Japan
[edit]
Editors: Steve Hanneke, Lev Reyzin
Algorithmic Learning Theory (ALT) 2017: Preface
Proceedings of the 28th International Conference on Algorithmic Learning Theory, PMLR 76:1-2
;[abs][Download PDF]
New bounds on the price of bandit feedback for mistake-bounded online multiclass learning
Proceedings of the 28th International Conference on Algorithmic Learning Theory, PMLR 76:3-10
;[abs][Download PDF]
Minimax rates for cost-sensitive learning on manifolds with approximate nearest neighbours
Proceedings of the 28th International Conference on Algorithmic Learning Theory, PMLR 76:11-56
;[abs][Download PDF]
Universality of Bayesian mixture predictors
Proceedings of the 28th International Conference on Algorithmic Learning Theory, PMLR 76:57-71
;[abs][Download PDF]
Erasing Pattern Languages Distinguishable by a Finite Number of Strings
Proceedings of the 28th International Conference on Algorithmic Learning Theory, PMLR 76:72-108
;[abs][Download PDF]
Non-Adaptive Randomized Algorithm for Group Testing
Proceedings of the 28th International Conference on Algorithmic Learning Theory, PMLR 76:109-128
;[abs][Download PDF]
Automatic Learning from Repetitive Texts
Proceedings of the 28th International Conference on Algorithmic Learning Theory, PMLR 76:129-150
;[abs][Download PDF]
Boundary Crossing for General Exponential Families
Proceedings of the 28th International Conference on Algorithmic Learning Theory, PMLR 76:151-184
;[abs][Download PDF]
Preference-based Teaching of Unions of Geometric Objects
Proceedings of the 28th International Conference on Algorithmic Learning Theory, PMLR 76:185-207
;[abs][Download PDF]
Specifying a positive threshold function via extremal points
Proceedings of the 28th International Conference on Algorithmic Learning Theory, PMLR 76:208-222
;[abs][Download PDF]
A minimax and asymptotically optimal algorithm for stochastic bandits
Proceedings of the 28th International Conference on Algorithmic Learning Theory, PMLR 76:223-237
;[abs][Download PDF]
Graph Verification with a Betweenness Oracle
Proceedings of the 28th International Conference on Algorithmic Learning Theory, PMLR 76:238-249
;[abs][Download PDF]
Lifelong Learning in Costly Feature Spaces
Proceedings of the 28th International Conference on Algorithmic Learning Theory, PMLR 76:250-287
;[abs][Download PDF]
Collaborative Clustering: Sample Complexity and Efficient Algorithms
Proceedings of the 28th International Conference on Algorithmic Learning Theory, PMLR 76:288-329
;[abs][Download PDF]
Parameter identification in Markov chain choice models
Proceedings of the 28th International Conference on Algorithmic Learning Theory, PMLR 76:330-340
;[abs][Download PDF]
The Complexity of Explaining Neural Networks Through (group) Invariants
Proceedings of the 28th International Conference on Algorithmic Learning Theory, PMLR 76:341-359
;[abs][Download PDF]
An efficient query learning algorithm for zero-suppressed binary decision diagrams
Proceedings of the 28th International Conference on Algorithmic Learning Theory, PMLR 76:360-371
;[abs][Download PDF]
Soft-Bayes: Prod for Mixtures of Experts with Log-Loss
Proceedings of the 28th International Conference on Algorithmic Learning Theory, PMLR 76:372-399
;[abs][Download PDF]
Hypotheses testing on infinite random graphs
Proceedings of the 28th International Conference on Algorithmic Learning Theory, PMLR 76:400-411
;[abs][Download PDF]
Scale-Invariant Unconstrained Online Learning
Proceedings of the 28th International Conference on Algorithmic Learning Theory, PMLR 76:412-433
;[abs][Download PDF]
Learning MSO-definable hypotheses on strings
Proceedings of the 28th International Conference on Algorithmic Learning Theory, PMLR 76:434-451
;[abs][Download PDF]
The Power of Random Counterexamples
Proceedings of the 28th International Conference on Algorithmic Learning Theory, PMLR 76:452-465
;[abs][Download PDF]
A Strongly Quasiconvex PAC-Bayesian Bound
Proceedings of the 28th International Conference on Algorithmic Learning Theory, PMLR 76:466-492
;[abs][Download PDF]
Normal Forms in Semantic Language Identification
Proceedings of the 28th International Conference on Algorithmic Learning Theory, PMLR 76:493-516
;[abs][Download PDF]
Efficient tracking of a growing number of experts
Proceedings of the 28th International Conference on Algorithmic Learning Theory, PMLR 76:517-539
;[abs][Download PDF]
Tight Bounds on $\ell_1$ Approximation and Learning of Self-Bounding Functions
Proceedings of the 28th International Conference on Algorithmic Learning Theory, PMLR 76:540-559
;[abs][Download PDF]
Relative Error Embeddings of the Gaussian Kernel Distance
Proceedings of the 28th International Conference on Algorithmic Learning Theory, PMLR 76:560-576
;[abs][Download PDF]
Adaptive Submodularity with Varying Query Sets: An Application to Active Multi-label Learning
Proceedings of the 28th International Conference on Algorithmic Learning Theory, PMLR 76:577-592
;[abs][Download PDF]
Structured Best Arm Identification with Fixed Confidence
Proceedings of the 28th International Conference on Algorithmic Learning Theory, PMLR 76:593-616
;[abs][Download PDF]
On Compressive Ensemble Induced Regularisation: How Close is the Finite Ensemble Precision Matrix to the Infinite Ensemble?
Proceedings of the 28th International Conference on Algorithmic Learning Theory, PMLR 76:617-628
;[abs][Download PDF]
Dealing with Range Anxiety in Mean Estimation via Statistical Queries
Proceedings of the 28th International Conference on Algorithmic Learning Theory, PMLR 76:629-640
;[abs][Download PDF]
Learning from Networked Examples
Proceedings of the 28th International Conference on Algorithmic Learning Theory, PMLR 76:641-666
;[abs][Download PDF]
PAC Learning Depth-3 $\textrm{AC}^0$ Circuits of Bounded Top Fanin
Proceedings of the 28th International Conference on Algorithmic Learning Theory, PMLR 76:667-680
;[abs][Download PDF]
A Modular Analysis of Adaptive (Non-)Convex Optimization: Optimism, Composite Objectives, and Variational Bounds
Proceedings of the 28th International Conference on Algorithmic Learning Theory, PMLR 76:681-720
;[abs][Download PDF]
subscribe via RSS