Online regularized pairwise learning with non-i.i.d. observations
From MaRDI portal
Publication:5063226
DOI10.1142/S0219691321500417OpenAlexW3199654083MaRDI QIDQ5063226
JingJing Zeng, Zhifei Sheng, Yimo Qin, Lei Yin, Bin Zou
Publication date: 17 March 2022
Published in: International Journal of Wavelets, Multiresolution and Information Processing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1142/s0219691321500417
Learning and adaptive systems in artificial intelligence (68T05) Applications of Markov chains and discrete-time Markov processes on general state spaces (social mobility, learning theory, industrial processes, etc.) (60J20)
Related Items (1)
Cites Work
- Generalization bounds for metric and similarity learning
- Consistency analysis of an empirical minimum error entropy algorithm
- Regularized least square regression with unbounded and dependent sampling
- Markov chains and stochastic stability
- Regularized least square regression with dependent samples
- Rates of convergence for empirical processes of stationary mixing sequences
- Optimum bounds for the distributions of martingales in Banach spaces
- The generalization performance of ERM algorithm with strongly mixing observations
- Online pairwise learning algorithms with convex loss functions
- Online regularized learning with pairwise loss functions
- Online learning algorithms
- Learning theory estimates via integral operators and their approximations
- On the mathematical foundations of learning
- Bernstein inequality and moderate deviations under strong mixing conditions
- Learning Theory
- Online Regularized Classification Algorithms
- Minimum complexity regression estimation with weakly dependent observations
- Online regularized pairwise learning with least squares loss
- Online Pairwise Learning Algorithms
- Uniform ergodicity and strong mixing
- Unnamed Item
- Unnamed Item
This page was built for publication: Online regularized pairwise learning with non-i.i.d. observations
