Online Learning with Costly Features and Labels

No abstract is available for this paper.

• Publication year

  2013

• Venue

  Neural Information Processing Systems

• Publication date

  2013-12-05

• Fields of study

  Mathematics, Computer Science

• Identifiers

  No identifiers available.

• External record

  Open on Semantic Scholar

• Source metadata

  Semantic Scholar

• No claims are published for this paper.

• No concepts are published for this paper.

• Online Learning under Delayed Feedback

  2013cited by this paper
• Budgeted Learning of Naive-Bayes Classifiers

  2012cited by this paper
• The Role of Information in Online Learning

  2012cited by this paper
• From Bandits to Experts: On the Value of Side-Observations

  2011influential reference
• Learning with Missing Features

  2011cited by this paper
• Distributed delayed stochastic optimization

  2011cited by this paper
• Efficient Learning with Partially Observed Attributes

  2010cited by this paper
• Active Learning Literature Survey

  2009cited by this paper
• Learning to classify with missing and corrupted features

  2008cited by this paper
• Prediction, learning, and games

  2006cited by this paper
• Regret Minimization Under Partial Monitoring

  2006cited by this paper
• On-line Learning with Delayed Label Feedback

  2005cited by this paper
• Learning and Classifying Under Hard Budgets

  2005cited by this paper
• Minimizing regret with label efficient prediction

  2004influential reference
• The Nonstochastic Multiarmed Bandit Problem

  2002influential reference
• On delayed prediction of individual sequences

  2002cited by this paper
• Budgeted learning of nailve-bayes classifiers

  2002cited by this paper

• A Polynomial-time Algorithm for Online Sparse Linear Regression with Improved Regret Bound under Weaker Conditions

  2025cites this paper
• Contextual Multi-Armed Bandit With Costly Feature Observation in Non-Stationary Environments

  2024cites this paper
• Data-Driven Online Recommender Systems With Costly Information Acquisition

  2023cites this paper
• Online Learning with Costly Features in Non-stationary Environments

  2023cites this paper
• Continuous Time Bandits with Sampling Costs

  2021cites this paper
• Linear Optimization with Sparsity Constraints

  2019cites this paper
• Online Linear Optimization with Sparsity Constraints

  2019cites this paper
• Classification with costly features in hierarchical deep sets

  2019cites this paper
• Online Algorithm for Unsupervised Sensor Selection

  2019cites this paper
• Classification with costly features as a sequential decision-making problem

  2019cites this paper
• Online Regression with Partial Information: Generalization and Linear Projection

  2018influential citation
• Adaptive Feature Selection: Computationally Efficient Online Sparse Linear Regression under RIP

  2017cites this paper
• Unsupervised Sequential Sensor Acquisition

  2017cites this paper
• Efficient Sublinear-Regret Algorithms for Online Sparse Linear Regression with Limited Observation

  2017cites this paper
• Inference and Learning: Computational Difficulty and Efficiency

  2017cites this paper
• Learning in the Real World: Constraints on Cost, Space, and Privacy

  2016cites this paper
• Sequential Learning without Feedback

  2016cites this paper
• Sparse Linear Regression

  2016cites this paper
• Online Sparse Linear Regression

  2016cites this paper
• Data-Driven Online Decision Making with Costly Information Acquisition

  2016cites this paper
• Data-Driven Online Decision Making with Costly Information Acquisition

  2016cites this paper
• Cheap Bandits

  2015cites this paper
• Cost effective algorithms for spectral bandits

  2015cites this paper
• Budgeted Prediction with Expert Advice

  2015cites this paper
• RELEAF: An Algorithm for Learning and Exploiting Relevance

  2015cites this paper
• Machine Learning Project Final Submission

  2015cites this paper
• Discover Relevant Sources : A Multi-Armed Bandit Approach

  2015cites this paper
• Attribute Efficient Linear Regression with Distribution-Dependent Sampling

  2015cites this paper
• Appendix for : Active Learning in Context-Driven Stream Mining with an Application to Image Mining

  2015influential citation
• Active Learning in Context-Driven Stream Mining With an Application to Image Mining

  2015influential citation
• Prediction with Limited Advice and Multiarmed Bandits with Paid Observations

  2014cites this paper
• Open Problem: Efficient Online Sparse Regression

  2014cites this paper
• Feature-Cost Sensitive Learning with Submodular Trees of Classifiers

  2014cites this paper
• Nonstochastic Multi-Armed Bandits with Graph-Structured Feedback

  2014cites this paper