Learning and Smoothed Analysis

DOI10.1109/FOCS.2009.60MaRDI QIDQ5171189zbMATH OpenOpenAlexFDO

Authors Alex Samorodnitsky, Adam Tauman Kalai, Shang-Hua Teng

Publication date 25 July 2014

Published in 2009 50th Annual IEEE Symposium on Foundations of Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1109/focs.2009.60

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05)

Cited in

(10)

• Speeding up random walk mixing by starting from a uniform vertex
• Risk inflation of sequential tests controlled by alpha investing
• Submodular functions: learnability, structure, and optimization
• Smoothed analysis for tensor methods in unsupervised learning
• Smoothed analysis with adaptive adversaries
• Attribute-efficient learning of monomials over highly-correlated variables
• Learning stochastic decision trees
• Survey on algorithms for multi-index models
• Smoothed analysis of local search algorithms
• Properly learning decision trees in almost polynomial time

This page was built for publication: Learning and Smoothed Analysis

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5171189)