Kernel balancing weights are generalized as KRRR, providing better confidence intervals for treatment effects.
problem Lack of generalization error, correct feature specification, and limited to average effects.
method Interpreting kernel balancing weights as KRRR, relaxing feature specification, and extending Gaussian approximation.
result KRRR provides strong generalization properties and justifies confidence sets for causal functions.
Two approaches to directly estimating Riesz representer are shown to be numerically equivalent under certain conditions.
problem Estimating Riesz representer in semiparametric statistics.
method Two distinct optimization problems solved by automatic debiased machine learning and sieve methods for conditional moment models.
result Numerical equivalence of estimators under specific regularization schemes, but not for others.
Unified framework for debiased machine learning using Riesz representer and Bregman divergence.
problem Estimating causal and structural parameters in machine learning.
method Generalized Riesz regression for fitting Riesz representer via Bregman divergence minimization.
result Automatic covariate balancing and Neyman orthogonality properties for debiased estimation.
Proposes adversarial method to estimate Riesz representer.
problem Estimating causal parameters as linear functionals of an underlying regression.
method Adversarial framework using general function spaces.
result Nonasymptotic mean square rate proved for neural networks, random forests, and RKHS.
Unified framework for estimating density ratios in causal inference.
problem Estimating density ratios for causal inference is challenging due to instability and curse of dimensionality.
method Bregman-Riesz regression unifies three methods: Bregman divergences, probabilistic classification, and Riesz loss.
result Unified framework improves density ratio estimation in causal inference.
Estimates heat kernel gradients on fractal-like cable systems.
problem Bounding gradients of heat kernels on complex fractal structures.
method Pointwise upper estimates for heat kernel gradients.
result Derives Lp-boundedness of quasi-Riesz transforms. Develops UKP for comparing feature representations in multitask learning.
problem Comparing feature representations learned by different models without access to test data.
method Uniform Kernel Prober (UKP) for comparing representations in kernel ridge regression tasks.
result UKP provides a uniform measure of prediction error on test data without access to test data.
Let M be a complete non-compact Riemannian manifold. In this paper, we derive sufficient conditions on metric perturbation for stability of Lp-boundedness of the Riesz transform, p∈(2,∞). We also provide counter-examples regarding in-stability for Lp-boundedness of Riesz transform.
Gradient boosting estimates Riesz representer for causal inference.
problem Estimating causal quantities using traditional methods is challenging and prone to variance issues.
method Gradient boosting algorithm to directly estimate Riesz representer.
result Gradient boosting performs similarly or better than traditional methods in estimating causal quantities.
One considers the class of complete non-compact Riemannian manifolds whose heat kernel satisfies Gaussian estimates from above and below. One shows that the Riesz transform is Lp bounded on such a manifold, for p ranging in an open interval above 2, if and only if the gradient of the heat kernel satisfies a certai…
Develops a direct debiased machine learning framework using Bregman divergence.
problem Reduces bias in machine learning estimates of causal effects or structural models.
method Neyman targeted estimation and generalized Riesz regression using Bregman divergence.
result Improves estimation of parameters of interest in causal models.
Riesz regression connects to density ratio estimation for causal inference.
problem Estimating average treatment effects in causal inference.
method Riesz regression as a signed density ratio and least-squares importance fitting.
result Riesz regression and DRE are equivalent, allowing transfer of DRE results.
In this paper we prove mixed norm estimates for Riesz transforms related to Laplace--Beltrami operators on compact Riemannian symmetric spaces of rank one. These operators are closely related to the Riesz transforms for Jacobi polynomials expansions. The key point is to obtain sharp estimates for the kernel of the Jaco…
The paper proves boundedness of a Riesz transform on weighted manifolds.
problem Establishing \(L^p\)-boundedness of the covariant Riesz transform on differential forms.
method Heat-kernel criterion, volume doubling, heat kernel estimates, curvature control, gradient bounds.
result The covariant Riesz transform is \(L^p\)-bounded for \(p>2\) on weighted Riemannian manifolds.
Paper improves MMD flow efficiency with Riesz kernels for image generation.
problem High computational costs in MMD flows for large scale computations.
method Introduces Riesz kernels and sliced MMD for efficient computation.
result Efficient computation of MMD gradients in one-dimensional setting.
Python package automates causal parameter estimation using Riesz regression.
problem Efficient estimation of causal and structural parameters.
method Automatic DML and generalized Riesz regression framework.
result Automatic construction of balancing link functions for generalized Riesz regression.
ROCK method generalizes MOCK for learning dynamical systems efficiently.
problem Learning dynamical systems from data efficiently.
method Variational formulation in Reproducing Kernel Hilbert Spaces.
result ROCK method is more computationally efficient and performs better on benchmarks.
The goal of this article is twofold: in a first part, we prove Gaussian estimates for the heat kernel of Schr{ö}dinger operators delta + V whose potential V is "small at infinity" in an integral sense. In a second part, we prove sharp boundedness result for the associated Riesz transform with potential d(delta+V) --1/2…
Improved AutoDML estimator for causal inference using outcome-adapted shared covariate representation.
problem Efficiency in estimating treatment or policy effects in causal inference.
method Outcome-adapted AutoDML estimator that uses a shared covariate representation that is predictive of the outcome but not the Riesz representer.
result Outcome-adapted AutoDML estimator is asymptotically more efficient than baseline AutoDML.
ScoreMatchingRiesz improves debiased machine learning and policy effects estimation.
problem Improving debiased machine learning and policy effects estimation.
method Score matching and Riesz representer estimation.
result Estimates policy path for continuous treatments, improving interpretability.
Optimal CATE estimation with structured contrast functions using KRR.
problem Estimating CATEs with complex response functions in RKHS.
method Unified two-stage kernel ridge regression method for structured contrast functions.
result Minimax rates governed by contrast function complexity, enabling adaptation.
Kernel-based function approximation improves reinforcement learning performance.
problem Average reward reinforcement learning in infinite horizon settings.
method Optimistic algorithm based on kernel ridge regression.
result No-regret performance guarantees and confidence intervals for kernel-based predictions.
Study proves NN matching is equivalent to Riesz regression for debiased machine learning.
problem Addressing bias in machine learning models.
method Interprets NN matching as Riesz regression and derives it from LSIF.
result NN matching is shown to be equivalent to Riesz regression.
Develops machine learning models for excited states of CH2NH2+.
problem Accurately predicting excited-state properties and couplings for CH2NH2+.
method Combines neural networks and kernel ridge regression, encoding electronic states in inputs.
result Improved accuracy in predicting excited-state properties and couplings.
Novel algorithm identifies nonlinear Granger causal relationships using kernel ridge regression.
problem Identification of nonlinear Granger causal relationships.
method Flexible plug-in architecture with kernel ridge regression using radial basis function.
result Kernel ridge regression in mlcausality achieves competitive AUC scores and more finely calibrated p-values.
Kernel ridge regression imputation with consistent variance estimation for handling missing data.
problem Handling missing data in statistical analysis.
method Kernel ridge regression imputation combined with entropy method for variance estimation.
result Root-n consistency of the imputation estimator in a Sobolev space setting.
We study minimal energy problems for strongly singular Riesz kernels on a manifold. Based on the spatial energy of harmonic double layer potentials, we are motivated to formulate the natural regularization of such problems by switching to Hadamard's partie finie integral operator which defines a strongly elliptic pseud…
In this paper, we show the equivalence between the boundedness of the Riesz transform dΔ−1/2 on Lp, p∈(2,p0), and the equality Hp=Lp, p∈(2,p0), in the class of manifold whose measure is doubling and for which the scaled Poincaré inequalities hold. Here, Hp is a Hardy space of exact 1−forms, …
Improves kernel ridge regression by optimizing scale and feature parameters.
problem Kernel ridge regression with fixed kernel.
method Introduces a matrix parameter U to optimize scale and feature parameters.
result Solves a nonlinear variational problem to optimize U.
Unified theory for causal inference using various methods.
problem Estimating causal effects in ATE estimation.
method Riesz regression, covariate balancing, DRE, TMLE, matching estimator.
result Unified theory integrating multiple methods for ATE estimation.
Let (Mm,g) be a m-dimensional complete Riemannian manifold which satisfies the n-Sobolev inequality and on which the volume growth is comparable to the one of Rn for big balls; if the Hodge Laplacian on 1-forms is strongly positive and the Ricci tensor is in L2n±ε for an ε>0, then we prove a G…
Paper proves convergence rates for Gaussian kernel ridge regression.
problem Understanding convergence rates for Gaussian kernel ridge regression.
method Establishes polynomial convergence rates for KRR with fixed hyperparameters.
result First polynomial convergence rates for Gaussian kernel ridge regression.
Represents neural networks as solutions to inverse problems in Banach spaces.
problem Understanding the function learned by neural networks.
method Variational framework, representer theorem, polynomial ridge splines.
result Neural networks are solutions to inverse problems in Banach spaces.
Improved kernel ridge regression for large datasets using weighted random binning.
problem Efficiently approximating kernel matrices for large-scale datasets.
method Introduced weighted random binning features for locality sensitive hashing.
result Weighted random binning features generate Gaussian processes of any desired smoothness.
pGMM kernel outperforms ordinary ridge regression and RBF kernel ridge regression without tuning.
problem Comparing pGMM kernel regression with other ridge regression methods.
method Implemented and compared pGMM kernel regression with ordinary ridge regression and RBF kernel ridge regression.
result pGMM kernel performs well without tuning and can match boosted trees with parameter tuning.
The paper extends kernel ridge regression to product kernels and reveals new convergence behaviors.
problem Understanding kernel ridge regression in large dimensions with various kernels.
method Established a broad family of large dimensional kernels and derived convergence rates.
result Revealed new phenomena including minimax optimality, saturation effect, and multiple descent behavior.
Let (M∘,g) be an asymptotically conic manifold, in the sense that M∘ compactifies to a manifold with boundary M in such a way that g becomes a scattering metric on M. A special case of particular interest is that of asymptotically Euclidean manifolds, where ∂M=Sn−1 and the induced me…
Sharp bounds derived for test error of finite-rank kernel ridge regression.
problem Loose bounds on test error for finite-rank kernels in machine learning.
method Sharp non-asymptotic upper and lower bounds for KRR test error.
result Tighter bounds on finite-rank KRR test error, valid for any regularization parameters.
STARK improves denoising of low-depth spatial transcriptomics images.
problem Denoising spatial transcriptomics images at ultra-low sequencing depths.
method Adaptive regularization with kernel ridge regression and graph Laplacian.
result STARK optimizes denoising performance over competing methods.
A new method for faster bandwidth selection in Gaussian kernel ridge regression.
problem Efficiently selecting the bandwidth in Gaussian kernel ridge regression.
method Formulated an approximate Jacobian expression for bandwidth selection, proposing a closed-form heuristic.
result Our method is as accurate as cross-validation and marginal likelihood maximization but up to six orders of magnitude faster.
Paper analyzes distributed learning with non-i.i.d. samples.
problem Learning rate analysis for distributed kernel ridge regression with dependent samples.
method Integral operator approach and covariance inequality for strong mixing sequences.
result Derives optimal learning rates for distributed kernel ridge regression.
Many machine learning problems can be formulated as predicting labels for a pair of objects. Problems of that kind are often referred to as pairwise learning, dyadic prediction or network inference problems. During the last decade kernel methods have played a dominant role in pairwise learning. They still obtain a stat…
Kernel ridge regression inference for nonstandard data.
problem Inferential theory for kernel ridge regression with nonstandard data.
method Constructs valid and sharp confidence sets using anti-symmetric multipliers.
result Develops a test for match effects in school matching mechanisms.
ParK efficiently solves kernel ridge regression for large datasets.
problem Large-scale kernel ridge regression efficiency and accuracy.
method Partitioning feature space with random projections and iterative optimization.
result Provably maintains statistical accuracy with reduced space and time complexity.
Two methods solve kernel ridge regression problems efficiently.
problem Solving kernel ridge regression problems with large datasets.
method RPCholesky and KRILL preconditioning techniques.
result Efficient solutions to KRR problems with strong guarantees.
Unified framework for linear attribution methods in deep learning.
problem Separate theoretical foundations of XAI attribution methods.
method GRALIS (Gradient-Riesz Averaged Locally-Integrated Shapley) framework.
result Unified representation theory for linear attribution methods.
We improve kernel ridge regression for skewed responses using oversampling and adaptive partitioning.
problem Kernel ridge regression struggles with skewed response variables, leading to poor estimates.
method Combines adaptive partitioning with oversampling to address skewed responses in kernel ridge regression.
result The proposed method yields estimates with smaller risk compared to classical methods under mild conditions.
The paper analyzes and improves the learning rates of distributed kernel ridge regression.
problem Generalization performance and learning rates of distributed kernel ridge regression.
method The paper derives optimal learning rates for DKRR in expectation and probability, proposes a communication strategy to improve learning performance, and evaluates these through theory and experiments.
result The communication strategy significantly improves the learning performance of DKRR, as demonstrated by both theoretical assessments and numerical experiments.