scientific article; zbMATH DE number 6982329
From MaRDI portal
Publication:4558184
zbMath1461.68205arXiv1602.05916MaRDI QIDQ4558184
Niloofar Yousefi, Mansooreh Mollaghasemi, Marius Kloft, Georgios C. Anagnostopoulos, Yunwen Lei
Publication date: 21 November 2018
Full work available at URL: https://arxiv.org/abs/1602.05916
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Classification and discrimination; cluster analysis (statistical aspects) (62H30) Inequalities; stochastic orderings (60E15) Learning and adaptive systems in artificial intelligence (68T05)
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A chain rule for the expected suprema of Gaussian processes
- Domain adaptation and sample bias correction theory and algorithm for regression
- A new approach to least-squares estimation, with applications
- Convex multi-task feature learning
- A notion of task relatedness yielding provable multiple-task learning guarantees
- Concentration inequalities using the entropy method
- A Bennett concentration inequality and its application to suprema of empirical processes
- Local Rademacher complexity: sharper risk bounds with and without unlabeled samples
- Empirical margin distributions and bounding the generalization error of combined classifiers
- Weak convergence and empirical processes. With applications to statistics
- Robust domain adaptation
- Local Rademacher complexities and oracle inequalities in risk minimization. (2004 IMS Medallion Lecture). (With discussions and rejoinder)
- Local Rademacher complexities
- Learning without Concentration
- Multi-task and Lifelong Learning of Kernels
- Trace Norm Regularization: Reformulations, Algorithms, and Multi-Task Learning
- Domain Adaptation in Regression
- Learning Theory
- A Uniform Lower Error Bound for Half-Space Learning
- Generalization Bounds for K-Dimensional Coding Schemes in Hilbert Spaces
- Rademacher penalties and structural risk minimization
- Learning Theory
- Learning Theory
- 10.1162/1532443041424337
- 10.1162/153244303321897690
- The Khintchine inequalities and martingale expanding sphere of their action
- Multi-task Learning for Computational Biology: Overview and Outlook
- Learning Theory and Kernel Machines
- The Rademacher Complexity of Linear Transformation Classes
- Model selection and error estimation
This page was built for publication:
