Research
On-device research index

arXiv research

A locally-built, LLM-digested index of recent arXiv papers in quant finance, geometry/topology, and statistical ML — keyword search served straight from SQLite on this machine.

168,695 papers · 148 categories

Trend · papers per month

12.5%25.0%37.5%50.0% · Sep 199319922001200920172026
48 results for kernel balancing weights

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.

New scalable method balances hospital profit status and heart attack outcomes.

problem Balancing covariate distributions and minimizing weight dispersion in large datasets.
method Combines kernel basis expansion and convex optimization for efficient and flexible weighting.
result For-profit hospitals use interventional cardiology similarly to other hospitals but have higher mortality and readmission rates.

New method for causal inference with complex treatment compositions.

problem Estimating causal effects with compositional treatments.
method Kernel-based covariate functional balancing approach.
result Achieves n\sqrt{n}-consistency without requiring consistent estimation of weights.

Novel characterization of augmented balancing weights combining outcome and weighting models.

problem Improving estimation accuracy in machine learning models with balancing weights.
method Characterization of augmented balancing weights as linear models, extending to ridge and lasso regression.
result Equivalence and closed-form expressions for specific model choices, providing insights into performance.

TKIL improves class-balanced performance in incremental learning.

problem Catastrophic forgetting in sequential learning tasks.
method Introduces Tangent Kernel for Incremental Learning (TKIL) based on Neural Tangent Kernel (NTK).
result TKIL achieves better overall accuracy and variance across classes.

SVM used for estimating treatment effects without confounding.

problem Estimating average treatment effects in the presence of confounding variables.
method Adapts SVM classifier as a kernel-based weighting procedure to balance covariates and estimate causal effects.
result SVM provides a continuous relaxation of the quadratic integer program for balancing covariates and maximizing effective sample size.

This paper balances bias and variance in adaptive importance sampling using mirror descent.

problem Large variance in adaptive importance sampling weights.
method Regularization strategy with power raised importance weights connected to mirror descent.
result The regularization parameter balances bias and variance.

Develops a weighting framework to generalize ITRs from source to target populations.

problem Challenges in generalizing ITRs from a source population to a target population with differing characteristics.
method A robust sample weighting framework using a reproducing kernel Hilbert space to balance covariates and improve ITR learning methods.
result Improves ITR estimation for the target population compared to other weighting methods.

A new kernel improves tensor classification accuracy and reduces computation time.

problem Challenges in classifying high-dimensional tensor data.
method Proposes a weighted subspace exponential kernel based on Tucker decomposition.
result The new kernel outperforms existing methods in accuracy and computational efficiency.

The Fock-Bargmann-Hartogs domain Dn,m(μ)D_{n,m}(μ) (μ>0μ>0) in Cn+m\mathbb{C}^{n+m} is defined by the inequality w2<eμz2,\|w\|^2<e^{-μ\|z\|^2}, where (z,w)Cn×Cm(z,w)\in \mathbb{C}^n\times \mathbb{C}^m, which is an unbounded non-hyperbolic domain in Cn+m\mathbb{C}^{n+m}. This paper introduces a Kähler metric αg(μ;ν)αg(μ;ν) (α>0)(α>0) on Dn,m(μ)D_{n,m}(μ), …

2015-12-31abs ↗pdf ↗

New geometric analysis of PWSPDs balances density and geometry in high-dimensional data.

problem Balancing density and geometry in high-dimensional data.
method Power-weighted shortest-path distances (PWSPDs) and their geometric and computational analyses.
result High probability guarantees on the equivalence of PWSPDs on complete and nearest neighbor graphs.

Improves causal inference with observational data by balancing features and weights.

problem Achieving balance in predictive features for causal inference with observational data.
method Integrates balancing weights into representation learning for causal learning.
result Developed an algorithm for accurate estimation of causal effects.

The paper reveals low-rank structure in neural network gradients, influenced by data and model parameters.

problem Investigating low-rank structure in gradients of neural networks under relaxed assumptions.
method Spiked data model, relaxation of isotropy assumptions, analysis of mean-field and neural-tangent-kernel scalings.
result Gradient of input weights is approximately low rank, dominated by two rank-one terms.

The paper proposes a new method for covariate balancing using IPM to improve causal inference.

problem Covariate imbalance in causal inference weighting methods, especially when models are not correctly specified.
method The integral probability metric (IPM) is used to determine optimal weights for treated and control groups.
result The proposed method can be consistent without specifying either the propensity score or outcome regression model.

Given a smooth polarized Riemann surface (X, L) endowed with a hyperbolic metric ωω with cusp singularities along a divisor D, we show the L^2 projective embedding of (X, D) defined by L^k is asymptotically almost balanced in a weighted sense. The proof depends on sufficiently precise understanding of the behavior of …

2016-05-03abs ↗pdf ↗

SIGTRON improves classification accuracy for imbalanced datasets.

problem Improving classification accuracy for imbalanced datasets.
method SIGTRON is a new sigmoid function with a convex loss function for imbalanced classification.
result SIGTRON models outperform existing methods in balanced and imbalanced datasets.

For a polarized Kähler manifold (X,L)(X, L), we show the equivalence between relative balanced embeddings introduced by Mabuchi and σσ-balanced embeddings introduced by Sano, answering a question of Hashimoto. We give a GIT characterization of the existence of a σσ-balanced embedding, and relate the optimal weight σσ t…

2017-10-06abs ↗pdf ↗

We introduce a new normalization technique that exhibits the fast convergence properties of batch normalization using a transformation of layer weights instead of layer outputs. The proposed technique keeps the contribution of positive and negative weights to the layer output balanced. We validate our method on a set o…

2018-12-11abs ↗pdf ↗

New findings show a balance between data fit and complexity in kernel hyperparameters.

problem Overcorrelation due to reparametrization of kernel hyperparameters.
method Reparametrization of kernel hyperparameters and analysis of marginal likelihood.
result Data fit term influences all other kernel hyperparameters, not just the complexity penalty.

Differentially private method for estimating individualized treatment rules.

problem Estimating individualized treatment rules while preserving privacy.
method Differentially private two-stage empirical risk minimization (DP-2ERM).
result Improved privacy-utility trade-off demonstrated through simulations and applications.

Kernel-UCBVI algorithm balances exploration and exploitation in metric state-action spaces.

problem Exploration-exploitation dilemma in finite-horizon reinforcement learning with metric state-action spaces.
method Kernel-UCBVI, leveraging smoothness and kernel estimators of rewards and transitions.
result First regret bound for kernel-based RL using smoothing kernels, O(H3K2d/(2d+1))O(H^3 K^{2d/(2d+1)}).

In this paper, we develop a novel weighted Laplacian method, which is partially inspired by the theory of graph Laplacian, to study recent popular graph problems, such as multilevel graph partitioning and balanced minimum cut problem, in a more convenient manner. Since the weighted Laplacian strategy inherits the virtu…

2019-11-23abs ↗pdf ↗

We propose new positive definite kernels for permutations. First we introduce a weighted version of the Kendall kernel, which allows to weight unequally the contributions of different item pairs in the permutations depending on their ranks. Like the Kendall kernel, we show that the weighted version is invariant to rela…

2018-02-23abs ↗pdf ↗

Thurston introduced shear deformations (cataclysms) on geodesic laminations - deformations including left and right displacements along geodesics. For hyperbolic surfaces with cusps, we consider shear deformations on disjoint unions of ideal geodesics. The length of a balanced weighted sum of ideal geodesics is defined…

2013-03-01abs ↗pdf ↗

Toeplitz operators linked to submultiplicative filtrations and weighted Bergman kernels.

problem Analyzing the asymptotics of weighted Bergman kernels for submultiplicative filtrations.
method Demonstrated that weight operator is a Toeplitz operator; analyzed asymptotics of weighted Bergman kernels.
result Local refinement of convergence of jumping measures towards geodesic ray pushforward measure.

We present a new approach to the problems of evaluating and learning personalized decision policies from observational data of past contexts, decisions, and outcomes. Only the outcome of the enacted decision is available and the historical policy is unknown. These problems arise in personalized medicine using electroni…

2017-05-21abs ↗pdf ↗

The paper analyzes how re-weighting helps in reducing variance in high-dimensional kernel methods under covariate shifts.

problem The challenge of high-dimensional kernel methods under covariate shifts and the role of re-weighting.
method Derives asymptotic expansion of high-dimensional kernels under covariate shifts, analyzes bias-variance decomposition, and characterizes the regularized kernel.
result Re-weighting helps in decreasing variance and can be seen as a data-dependent regularization.

Adaptive weights improve physics-informed neural networks and deep operator networks.

problem Training physics-informed neural networks and deep operator networks can be challenging, leading to unsatisfactory accuracy and efficiency.
method Proposes a pointwise adaptive weighting method that balances the residual decay rate across different training points.
result Our proposed approach of balanced residual decay rates offers advantages including bounded weights, high prediction accuracy, fast convergence rate, low training uncertainty, low computational cost, and ease of hyperparameter tuning.

Proposes a simple framework to balance task difficulty in multi-task learning.

problem Varying difficulty levels among different tasks in multi-task learning.
method Introduces a Balanced Multi-Task Learning (BMTL) framework that transforms training losses to balance task difficulty.
result Empirical studies show state-of-the-art performance of the proposed BMTL framework.

The paper calculates heat kernel and closed geodesic asymptotics for nilpotent coverings.

problem Heat kernel and closed geodesic asymptotics for nilpotent coverings.
method Finite-dimensional rational Floquet-Bloch theory, Pytlik functional, and spectral sums.
result Genuinely local, pointwise higher-order heat-kernel expansions.

The paper studies heat kernels on weighted Riemannian manifolds with curvature bounds.

problem Estimating heat kernels on weighted Riemannian manifolds with lower Ricci curvature bounds.
method Establishing parabolic Harnack inequalities, proving Gaussian bounds for heat kernels, and constructing Li-Yau-type gradient estimates.
result Gaussian upper and lower bounds for the heat kernel, Liouville theorem, uniqueness property, and eigenvalue bounds.

Estimation of importance sampling weights for off-policy evaluation of contextual bandits often results in imbalance - a mismatch between the desired and the actual distribution of state-action pairs after weighting. In this work we present balanced off-policy evaluation (B-OPE), a generic method for estimating weights…

2019-06-09abs ↗pdf ↗