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

72143215286 · Jun 202019922001200920172026
48 results for balancing weights

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.

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.

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.

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.

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.

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 ↗

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.

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 ↗

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 ↗

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.

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 ↗

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.

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 ↗

The paper studies matrix normalization and graph balancing using a new functional and gradient descent.

problem Matrix normalization and graph balancing.
method A new functional called the non-normal energy, and gradient descent.
result Gradient descent of the non-normal energy converges to balanced graphs and preserves spectra and realness of weights.

We study the problem of partitioning a small sample of nn individuals from a mixture of kk product distributions over a Boolean cube {0,1}K\{0, 1\}^K according to their distributions. Each distribution is described by a vector of allele frequencies in RK\R^K. Given two distributions, we use γγ to denote the average $\el…

2008-02-10abs ↗pdf ↗

A {\em balanced} spatial graph has an integer weight on each edge, so that the directed sum of the weights at each vertex is zero. We describe the Alexander module and polynomial for balanced spatial graphs (originally due to Kinoshita \cite{ki}), and examine their behavior under some common operations on the graph. We…

2015-06-19abs ↗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.

The classical kk-means algorithm for partitioning nn points in Rd\mathbb{R}^d into kk clusters is one of the most popular and widely spread clustering methods. The need to respect prescribed lower bounds on the cluster sizes has been observed in many scientific and business applications. In this paper, we present an…

2013-08-19abs ↗pdf ↗

Lo-Hp decouples weight generation into local and global policies to improve flexibility and efficiency.

problem Over-coupling and long-horizon issues in current optimization methods.
method Hybrid-Policy Sub-Trajectory Balance objective.
result Learning local optimization policies addresses long-horizon issues and enhances global weight generation.

WiGS improves active learning for regression by dynamically selecting informative samples.

problem Reducing labeling costs in regression tasks.
method Formulated as a reinforcement learning problem, WiGS adapts the exploration-investigation balance.
result WiGS outperforms static methods in accuracy and labeling efficiency, especially in irregular data density.

A new algorithm improves credit scoring accuracy for imbalanced data.

problem Poor classification of minority class in credit scoring data sets.
method Weighted-Hybrid-Sampling-Boost (WHSBoost) algorithm with balanced data sampling.
result WHSBoost outperforms other methods in credit scoring accuracy.

Under the assumption of asymptotic relative Chow-stability for polarized algebraic manifolds (M,L)(M, L), a series of weighted balanced metrics ωmω_m, m1m \gg 1, called polybalanced metrics, are obtained from complete linear systems Lm|L^m| on MM. Then the asymptotic behavior of the weights as mm \to \infty will be stud…

2011-03-30abs ↗pdf ↗

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.

We solve tensor balancing, rescaling an Nth order nonnegative tensor by multiplying N tensors of order N - 1 so that every fiber sums to one. This generalizes a fundamental process of matrix balancing used to compare matrices in a wide range of applications from biology to economics. We present an efficient balancing a…

2017-02-27abs ↗pdf ↗

Transfer learning has achieved promising results by leveraging knowledge from the source domain to annotate the target domain which has few or none labels. Existing methods often seek to minimize the distribution divergence between domains, such as the marginal distribution, the conditional distribution or both. Howeve…

2018-07-02abs ↗pdf ↗

New meta-learning method improves domain generalization by balancing parameters closer to domain centroids.

problem Improving domain generalization by reducing overfitting to specific domains.
method Arithmetic meta-learning with arithmetic-weighted gradients to balance parameters closer to domain centroids.
result Experimental validation of improved domain generalization performance.

SONA improves conditional generation by balancing authenticity and alignment.

problem Challenges in balancing authenticity and conditional alignment in conditional generative models.
method SONA integrates unconditional discrimination, matching-aware supervision, and adaptive weighting to balance authenticity and alignment.
result SONA achieves superior sample quality and conditional alignment compared to state-of-the-art methods.