Computational complexity of kernel-based density-ratio estimation: a condition number analysis
From MaRDI portal
Publication:1945037
DOI10.1007/s10994-012-5323-6zbMath1260.68334arXiv0912.2800OpenAlexW2086619942MaRDI QIDQ1945037
Masashi Sugiyama, Takafumi Kanamori, Taiji Suzuki
Publication date: 28 March 2013
Published in: Machine Learning (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/0912.2800
Estimation in multivariate analysis (62H12) Analysis of algorithms and problem complexity (68Q25) Learning and adaptive systems in artificial intelligence (68T05)
Related Items (7)
Model-based policy gradients with parameter-based exploration by least-squares conditional density estimation ⋮ Statistical analysis of kernel-based least-squares density-ratio estimation ⋮ Least-squares two-sample test ⋮ Semi-supervised learning of class balance under class-prior change by distribution matching ⋮ Direct density-ratio estimation with dimensionality reduction via least-squares hetero-distributional subspace search ⋮ Dimensionality reduction for density ratio estimation in high-dimensional spaces ⋮ Change-point detection in time-series data by relative density-ratio estimation
Uses Software
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
- Direct importance estimation for covariate shift adaptation
- Statistical analysis of kernel-based least-squares density-ratio estimation
- A preconditioning technique for a class of PDE-constrained optimization problems
- Robin-Robin preconditioned Krylov methods for fluid-structure interaction problems
- Probabilistic analysis of condition numbers for linear programming
- The complexity of semilinear problems in succinct representation
- Smoothed analysis of complex conic condition numbers
- Estimates on the distribution of the condition number of singular matrices
- Smoothed analysis of integer programming
- Linear and nonlinear programming.
- Coverage processes on spheres and condition numbers for linear programming
- Complexity theory of numerical linear algebra
- Complexity of Bezout's theorem. V: Polynomial time
- On the expected condition number of linear programming problems
- Improving predictive inference under covariate shift by weighting the log-likelihood function
- Density-ratio matching under the Bregman divergence: a unified framework of density-ratio estimation
- Least-squares two-sample test
- General formulas for the smoothed analysis of condition numbers
- Some results on Tchebycheffian spline functions and stochastic processes
- 10.1162/153244302760185252
- Density Ratio Estimation in Machine Learning
- Least-Squares Independent Component Analysis
- Smoothed Analysis of Moore–Penrose Inversion
- Smoothed Analysis of the Condition Numbers and Growth Factors of Matrices
- Smoothed analysis of algorithms
- Input-dependent estimation of generalization error under covariate shift
- Worst-Case and Smoothed Analysis of k-Means Clustering with Bregman Divergences
- Matrix Analysis
- Evaluating Rational Functions: Infinite Precision is Finite Cost and Tractable on Average
- The Probability That a Numerical Analysis Problem is Difficult
- Eigenvalues and Condition Numbers of Random Matrices
- The fundamental theorem of algebra and complexity theory
- On the Distribution of a Scaled Condition Number
- Numerical Optimization
- On the Efficiency of Newton's Method in Approximating All Zeros of a System of Complex Polynomials
- Incorporating Condition Measures into the Complexity Theory of Linear Programming
- Complexity of Bezout’s Theorem IV: Probability of Success; Extensions
- Sequential change‐point detection based on direct density‐ratio estimation
- Estimating Divergence Functionals and the Likelihood Ratio by Convex Risk Minimization
- Training a Support Vector Machine in the Primal
- Average-Case and Smoothed Competitive Analysis of the Multilevel Feedback Algorithm
- Tails of Condition Number Distributions
- Convex Analysis
- Numerical inverting of matrices of high order
- ROUNDING-OFF ERRORS IN MATRIX PROCESSES
- Theory of Reproducing Kernels
- Soft margins for AdaBoost
- Characterizations, bounds, and probabilistic analysis of two complexity measures for linear programming problems
This page was built for publication: Computational complexity of kernel-based density-ratio estimation: a condition number analysis
