Multiple-source adaptation theory and algorithms
From MaRDI portal
Publication:2035631
DOI10.1007/s10472-020-09716-0zbMath1490.68194OpenAlexW3097191881MaRDI QIDQ2035631
Ningshan Zhang, Mehryar Mohri, Judy Hoffman
Publication date: 25 June 2021
Published in: Annals of Mathematics and Artificial Intelligence (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10472-020-09716-0
Learning and adaptive systems in artificial intelligence (68T05) Statistical aspects of information-theoretic topics (62B10)
Related Items (2)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Domain adaptation and sample bias correction theory and algorithm for regression
- Exponential lower bounds for finding Brouwer fixed points
- Convex analysis approach to d. c. programming: Theory, algorithms and applications
- Relative deviation learning bounds and generalization with unbounded loss functions
- DC programming: overview.
- A Proof of Convergence of the Concave-Convex Procedure Using Zangwill's Theory
- Rényi Divergence and Kullback-Leibler Divergence
- Matching algorithmic bounds for finding a Brouwer fixed point
- A theory of the learnable
- A D.C. Optimization Algorithm for Solving the Trust-Region Subproblem
- Homotopies for computation of fixed points
- The Concave-Convex Procedure
- On Choosing and Bounding Probability Metrics
- Elements of Information Theory
- The Approximation of Fixed Points of a Continuous Mapping
- SIMPLICIAL APPROXIMATION OF FIXED POINTS
This page was built for publication: Multiple-source adaptation theory and algorithms