Pages that link to "Item:Q1856371"
From MaRDI portal
The following pages link to Learning and generalisation. With applications to neural networks. (Q1856371):
Displayed 35 items.
- On a clustering criterion for dependent observations (Q389296) (← links)
- Generalization bounds of ERM algorithm with Markov chain samples (Q403479) (← links)
- Generalization bounds of ERM algorithm with \(V\)-geometrically ergodic Markov chains (Q429786) (← links)
- Indexability, concentration, and VC theory (Q450514) (← links)
- Monte Carlo algorithms for optimal stopping and statistical learning (Q558680) (← links)
- Simulation-based optimization of Markov decision processes: an empirical process theory approach (Q608432) (← links)
- Learning performance of Tikhonov regularization algorithm with geometrically beta-mixing observations (Q619769) (← links)
- Classification with non-i.i.d. sampling (Q652859) (← links)
- Generalization performance of least-square regularized regression algorithm with Markov chain samples (Q662073) (← links)
- Probabilistic methods in cancer biology (Q693685) (← links)
- Generalization performance of Lagrangian support vector machine based on Markov sampling (Q830752) (← links)
- Regularized least square regression with dependent samples (Q849335) (← links)
- Unsupervised slow subspace-learning from stationary processes (Q950200) (← links)
- Computational complexity of randomized algorithms for solving parameter-dependent linear matrix inequalities. (Q1421455) (← links)
- Localization of VC classes: beyond local Rademacher complexities (Q1663641) (← links)
- Price of anarchy in electric vehicle charging control games: when Nash equilibria achieve social welfare (Q1716453) (← links)
- Lower bounds on performance of metric tree indexing schemes for exact similarity search in high dimensions (Q1950389) (← links)
- SVM-boosting based on Markov resampling: theory and algorithm (Q2057733) (← links)
- Probabilistic feasibility guarantees for solution sets to uncertain variational inequalities (Q2071967) (← links)
- A statistical learning perspective on switched linear system identification (Q2081825) (← links)
- Lasso guarantees for \(\beta \)-mixing heavy-tailed time series (Q2196212) (← links)
- Generalization performance of Gaussian kernels SVMC based on Markov sampling (Q2339390) (← links)
- Error bounds for compressed sensing algorithms with group sparsity: A unified approach (Q2399645) (← links)
- Learning rates of regularized regression for exponentially strongly mixing sequence (Q2427169) (← links)
- Fast learning from \(\alpha\)-mixing observations (Q2443266) (← links)
- The performance bounds of learning machines based on exponentially strongly mixing sequences (Q2458710) (← links)
- Is the \(k\)-NN classifier in high dimensions affected by the curse of dimensionality? (Q2629451) (← links)
- Learning from non-irreducible Markov chains (Q2691133) (← links)
- Learning rate of magnitude-preserving regularization ranking with dependent samples (Q2800842) (← links)
- ℓ<sup>1</sup>-Norm support vector machine for ranking with exponentially strongly mixing sequence (Q2930104) (← links)
- Non parametric learning approach to estimate conditional quantiles in the dependent functional data case (Q4975143) (← links)
- Optimal rate for support vector machine regression with Markov chain samples (Q5248169) (← links)
- Learning Theory Estimates with Observations from General Stationary Stochastic Processes (Q5380606) (← links)
- Stationary Density Estimation of Itô Diffusions Using Deep Learning (Q5886225) (← links)
- Consistency of maximum likelihood for continuous-space network models. I (Q6200881) (← links)