Online Sparse Linear Regression
暂无分享,去创建一个
[1] David Steurer,et al. Analytical approach to parallel repetition , 2013, STOC.
[2] Ohad Shamir,et al. Efficient Learning with Partially Observed Attributes , 2010, ICML.
[3] Russell Greiner,et al. Online Learning with Costly Features and Labels , 2013, NIPS.
[4] Elad Hazan,et al. Linear Regression with Limited Observation , 2012, ICML.
[5] Sanjeev Arora,et al. The Multiplicative Weights Update Method: a Meta-Algorithm and Applications , 2012, Theory Comput..
[6] Shai Ben-David,et al. Learning with restricted focus of attention , 1993, COLT '93.
[7] Elad Hazan,et al. Logarithmic regret algorithms for online convex optimization , 2006, Machine Learning.
[8] Noga Alon,et al. The Probabilistic Method , 2015, Fundamentals of Ramsey Theory.
[9] Hans Ulrich Simon,et al. On restricted-focus-of-attention learnability of Boolean functions , 1996, COLT '96.
[10] Balas K. Natarajan,et al. Sparse Approximate Solutions to Linear Systems , 1995, SIAM J. Comput..
[11] Satyen Kale,et al. Open Problem: Efficient Online Sparse Regression , 2014, COLT.
[12] Ohad Shamir,et al. Attribute Efficient Linear Regression with Distribution-Dependent Sampling , 2015, ICML.
[13] Dean P. Foster,et al. Variable Selection is Hard , 2014, COLT.
[14] Adam Tauman Kalai,et al. Online convex optimization in the bandit setting: gradient descent without a gradient , 2004, SODA '05.