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

4.5%9.1%13.6%18.2% · Dec 199419922001200920172026
48 results for augmented balancing 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.

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.

Synthetic data augmentation can improve imbalanced classification metrics.

problem Improving imbalanced classification metrics
method Developing a framework for analyzing the effects of synthetic data augmentation on score-based classification
result Augmentation can improve AUROC, AUPRC, balanced accuracy, and F1 score

Synthetic augmentation helps but not always in imbalanced learning.

problem Imbalanced learning causes poor performance on rare classes.
method Developed a statistical framework for synthetic augmentation in imbalanced learning.
result Synthetic augmentation is not always beneficial and depends on the imbalance regime.

A study on optimizing data augmentation weights for improved test-time predictions.

problem Improving robustness of predictions during testing with data augmentation methods.
method A weighted Test-Time Augmentation (TTA) approach based on variational Bayesian framework to optimize weights.
result Optimizing weights suppresses unwanted data augmentations and improves prediction performance.

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.

This paper explores how representation learning can improve design-based causal inference.

problem Estimating causal effects in design-based studies is challenging due to the need for optimal weights.
method The authors propose an end-to-end estimation procedure that learns a flexible representation to minimize the error in choosing a representation.
result The proposed method is competitive in various causal inference tasks and shows promise for improving design-based weights.

This paper improves auto-augment efficiency by sharing augmentation weights.

problem Efficient evaluation of augmentation policies for model training.
method Augmentation-Wise Weight Sharing (AWS) to create a fast yet accurate proxy task.
result Augmentation policies found achieve superior accuracies compared to existing methods.

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.

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.

Adaptive weighting schemes enhance time-series data augmentation for financial and UCR datasets.

problem Limited size of time-series datasets hinders model performance.
method Two adaptive weighting schemes for automatic data augmentation.
result Improves annualized returns by over 50% on financial dataset and outperforms state-of-the-art on half of UCR datasets.

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.

M2m method improves deep learning performance on class-imbalanced datasets.

problem Class imbalance in labeled training datasets causes deep neural networks to generalize poorly to minority classes.
method Augment less-frequent classes by translating samples from more-frequent classes.
result Significantly improves generalization on minority classes compared to existing methods.

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.

Image classification datasets are often imbalanced, characteristic that negatively affects the accuracy of deep-learning classifiers. In this work we propose balancing GAN (BAGAN) as an augmentation tool to restore balance in imbalanced datasets. This is challenging because the few minority-class images may not be enou…

2018-03-26abs ↗pdf ↗

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 ↗

SOOTT framework optimizes target tracking with robust and learning-augmented algorithms.

problem Optimizing target tracking in dynamic environments with adversarial perturbations.
method Integrates robust and learning-augmented algorithms for online decision-making.
result CoRT learning-augmented algorithm strictly improves over robust BEST when predictions are accurate.

The paper addresses classification imbalance by framing it as a transfer learning problem.

problem Classification imbalance where one class is much rarer than the other.
method The paper studies oversampling procedures to balance classes, focusing on SMOTE and bootstrapping.
result The excess risk decomposes into balanced training rate and transfer cost, with SMOTE having a higher transfer cost.

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 ↗

Enhanced financial forecasting using supervised autoencoders with noise augmentation and triple labeling.

problem Improving investment strategy performance on noisy financial data.
method Supervised autoencoders with noise augmentation and triple barrier labeling.
result Supervised autoencoders with balanced noise augmentation and bottleneck size significantly boost strategy effectiveness.

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 ↗

Improves group fairness in tensor completion by augmenting tensors with balanced entities.

problem Preventing discrimination in tensor decomposition based on social grounds.
method STAFF (Sparse Tensor Augmentation For Fairness) which augments tensors with balanced entities to mitigate imbalance and bias.
result Consistently shows the best trade-off between completion error and group fairness, reducing errors by 36% and 59% respectively.

We introduce a notion of cardinality for the augmentation category associated to a Legendrian knot or link in standard contact R^3. This `homotopy cardinality' is an invariant of the category and allows for a weighted count of augmentations, which we prove to be determined by the ruling polynomial of the link. We prese…

2015-11-20abs ↗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 ↗

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 ↗

MASC balances dataset representation using affinity clustering and distribution discrepancies.

problem Representation bias in datasets due to group imbalance.
method MASC uses affinity clustering and pairwise distribution discrepancies to balance non-protected and protected groups.
result MASC effectively debiases target datasets, comparable to existing methods.

New findings show tool-augmented models can recall unlimited facts, outperforming purely memorized models.

problem Limitations of purely memorized models in recalling large amounts of factual information.
method Demonstrated the benefits of in-tool learning (external retrieval) over in-weight learning (memorization) for factual recall.
result Proved that tool-use enables unbounded factual recall via a simple and efficient circuit construction.

Manipulating data, such as weighting data examples or augmenting with new instances, has been increasingly used to improve model training. Previous work has studied various rule- or learning-based approaches designed for specific types of data manipulation. In this work, we propose a new method that supports learning d…

2019-10-28abs ↗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.