Results 121 to 130 of about 299,812 (168)
Some of the next articles are maybe not open access.
Annual Review of Statistics and Its Application, 2021
Online learning is a framework for the design and analysis of algorithms that build predictive models by processing data one at the time. Besides being computationally efficient, online algorithms enjoy theoretical performance guarantees that do not rely on statistical assumptions on the data source.
N. Cesa Bianchi, F. Orabona
openaire +2 more sources
Online learning is a framework for the design and analysis of algorithms that build predictive models by processing data one at the time. Besides being computationally efficient, online algorithms enjoy theoretical performance guarantees that do not rely on statistical assumptions on the data source.
N. Cesa Bianchi, F. Orabona
openaire +2 more sources
Online Pairwise Learning Algorithms
Neural Computation, 2016Pairwise learning usually refers to a learning task that involves a loss function depending on pairs of examples, among which the most notable ones are bipartite ranking, metric learning, and AUC maximization. In this letter we study an online algorithm for pairwise learning with a least-square loss function in an unconstrained setting of a reproducing
Ying, Yiming, Zhou, Ding-Xuan
openaire +2 more sources
ACM Computing Surveys, 2016
In online scenarios requests arrive over time, and each request must be serviced in an irrevocable manner before the next request arrives. Online algorithms with advice is an area of research where one attempts to measure how much knowledge of future requests is necessary to achieve a given performance level, as defined by the competitive ratio.
Joan Boyar +4 more
openaire +3 more sources
In online scenarios requests arrive over time, and each request must be serviced in an irrevocable manner before the next request arrives. Online algorithms with advice is an area of research where one attempts to measure how much knowledge of future requests is necessary to achieve a given performance level, as defined by the competitive ratio.
Joan Boyar +4 more
openaire +3 more sources
2023
Online algorithms are a rich area of research with widespread applications in scheduling, combinatorial optimization, and resource allocation problems. This lucid textbook provides an easy but rigorous introduction to online algorithms for graduate and senior undergraduate students.
openaire +1 more source
Online algorithms are a rich area of research with widespread applications in scheduling, combinatorial optimization, and resource allocation problems. This lucid textbook provides an easy but rigorous introduction to online algorithms for graduate and senior undergraduate students.
openaire +1 more source
Online Co-regularized Algorithms
2012We propose an online co-regularized learning algorithm for classification and regression tasks. We demonstrate that by sequentially co-regularizing prediction functions on unlabeled data points, our algorithm provides improved performance in comparison to supervised methods on several UCI benchmarks and a real world natural language processing dataset.
Ruijter, T. de +2 more
openaire +3 more sources
2012
We show that a commonly-used sampling theoretical attribute discretization algorithm ChiMerge can be implemented efficiently in the online setting. Its benefits include that it is efficient, statistically justified, robust to noise, can be made to produce low-arity partitions, and has empirically been observed to work well in practice.
Saarela Matti +2 more
openaire +1 more source
We show that a commonly-used sampling theoretical attribute discretization algorithm ChiMerge can be implemented efficiently in the online setting. Its benefits include that it is efficient, statistically justified, robust to noise, can be made to produce low-arity partitions, and has empirically been observed to work well in practice.
Saarela Matti +2 more
openaire +1 more source
Mathematical Programming, 2003
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +3 more sources
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +3 more sources
Noisy intermediate-scale quantum algorithms
Reviews of Modern Physics, 2022Kishor Bharti +2 more
exaly
Quantum Information and Algorithms for Correlated Quantum Matter
Chemical Reviews, 2021Kade Head-Marsden +2 more
exaly