Pages that link to "Item:Q2989484"
From MaRDI portal
The following pages link to The Generalization Ability of Online Algorithms for Dependent Data (Q2989484):
Displaying 14 items.
- Optimal learning with Bernstein Online Aggregation (Q72768) (← links)
- Simpler PAC-Bayesian bounds for hostile data (Q1640576) (← links)
- Generalization ability of online pairwise support vector machine (Q1996328) (← links)
- SVM-boosting based on Markov resampling: theory and algorithm (Q2057733) (← links)
- Discrepancy-based theory and algorithms for forecasting non-stationary time series (Q2188766) (← links)
- Statistical learning based on Markovian data maximal deviation inequalities and learning rates (Q2202513) (← links)
- On biased random walks, corrupted intervals, and learning under adversarial design (Q2202524) (← links)
- Empirical risk minimization and complexity of dynamical models (Q2215723) (← links)
- Generalization bounds for non-stationary mixing processes (Q2360972) (← links)
- (Q4558573) (← links)
- Sampling and empirical risk minimization (Q5276167) (← links)
- Prediction of time series by statistical learning: general losses and fast rates (Q5417591) (← links)
- Stochastic online convex optimization. Application to probabilistic time series forecasting (Q6200884) (← links)
- A generalization bound of deep neural networks for dependent data (Q6540912) (← links)
