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,742 papers · 148 categories

Trend · papers per month

110220329439 · Jun 202019922001200920172026
48 results for feature balancing

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.

Cross-balancing improves causal inference by balancing features with outcome data.

problem Balancing features for valid causal inference when outcome data is available.
method Cross-balancing using sample splitting to separate feature construction and weight estimation errors.
result Cross-balancing produces consistent, asymptotically normal, and efficient estimators under mild conditions.

MCNet improves uncertainty calibration in online advertising by modeling complex relations and balancing performance.

problem Lack of effective calibration for complex relations and context features in online advertising.
method Introduces MCNet with MCF, order-preserving, and field-balance regularizers.
result Superior performance in generating well-calibrated probability predictions on public and industrial datasets.

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.

In many important machine learning applications, the training distribution used to learn a probabilistic classifier differs from the testing distribution on which the classifier will be used to make predictions. Traditional methods correct the distribution shift by reweighting the training data with the ratio of the de…

2018-06-16abs ↗pdf ↗

Proposes a balanced multi-component and multi-layer neural network for efficient function approximation.

problem Accurately and efficiently approximating complex functions with high degrees of freedom and computational cost.
method Inspired by a multi-component approach, MMNN combines single-layer networks with a multi-layer decomposition strategy.
result Significant reduction in training parameters, more efficient training process, and improved accuracy compared to FCNNs or MLPs.

Compared to in-clinic balance training, in-home training is not as effective. This is, in part, due to the lack of feedback from physical therapists (PTs). Here, we analyze the feasibility of using trunk sway data and machine learning (ML) techniques to automatically evaluate balance, providing accurate assessments out…

2019-06-07abs ↗pdf ↗

Paper proposes D3M to improve anti-spoofing detection by balancing loss function and using complementary features.

problem Improving automatic speaker verification systems against high-quality playback attacks.
method D3M uses a balanced focal loss function to dynamically scale loss based on sample traits, and combines three feature types for robust detection.
result D3M systems outperform conventional methods significantly, achieving min-tDCF of 0.0124 and EER of 0.55%.

LP-FT improves personalized model training in FL by balancing generalization and personalization.

problem Federated Learning struggles with balancing global generalization and local personalization due to non-identical data distributions.
method Adapting Linear Probing followed by full Fine-Tuning (LP-FT) to the FL setting.
result LP-FT outperforms standard fine-tuning in balancing personalization and generalization across various datasets and PFT variants.

GENIE balances domain-invariant feature learning and gradient alignment for improved DG performance.

problem Domain Generalization (DG) overfitting to domain-specific features
method GENIE (Generalization-ENhancing Iterative Equalizer) optimizer
result Prevents a small subset of parameters from dominating optimization, promoting domain-invariant feature learning

Jigsaw-VAE tackles feature imbalance in VAE latent variables, improving generalization across environments.

problem Feature imbalance in VAE latent variables leads to poor generalization and biased sample generation.
method Proposes a regularization scheme to balance features in VAE latent variables and introduces a metric to measure balance.
result The regularization scheme substantially addresses feature imbalance, leading to improved generalization and diverse sample generation.

Study reveals class disparities in balanced datasets through spectral imbalance.

problem Class disparities in balanced datasets are overlooked despite model performance gaps.
method Developed a theoretical framework and studied 11 encoders to diagnose spectral imbalance.
result Identified spectral imbalance as a source of class disparities in balanced datasets.

ContextBench benchmarks methods for generating linguistically fluent inputs that activate specific latent features in language models.

problem Identifying inputs that trigger specific behaviours or latent features in language models.
method Context modification and benchmarking methods like Evolutionary Prompt Optimisation (EPO) with LLM-assistance and diffusion model inpainting.
result Enhanced methods achieve state-of-the-art performance in balancing elicitation effectiveness and fluency.

A RL framework selects features to balance bias and accuracy dynamically.

problem Bias in automated feature selection when predictors are correlated.
method Multi-component reward function with policy gradient for dynamic regularization and bias mitigation.
result Model balances fairness and accuracy during training.

FSRM method improves treatment effect estimation from observational data.

problem Estimating treatment effects from observational data with missing counterfactual outcomes and selection bias.
method FSRM method based on deep representation learning and matching, which maps covariate space into a selective, nonlinear, and balanced representation space.
result FSRM method outperforms state-of-the-art methods in estimating treatment effects.

This paper optimizes clustering interpretability by balancing value and user-defined features.

problem Generating interpretable clusters in graph data.
method Proposes a β-interpretable clustering algorithm that ensures at least β fraction of nodes share the same feature value.
result Empirical demonstration of the benefits of the proposed approaches in generating interpretable clusters.

New mortgage contracts reduce underwater default by adjusting loan balances, but must balance prepayment incentives.

problem Underwater default incentives in mortgages.
method Analyzes automatic balance adjustment and prepayment penalties in mortgage contracts.
result Automatic balance adjustments are preferable to traditional contracts at certain spreads, reducing underwater default.

Paper explores balancing market dynamics and interpretable forecasting models for energy prices.

problem Tackles the challenge of accurately predicting mFRR price and understanding market dynamics.
method Compares XGBoost and EBM for forecasting mFRR activation price in the balancing market.
result EBM provides comparable forecasting accuracy to XGBoost but with higher interpretability.

New bounds for high-dimensional sparse linear bandits, balancing information and regret.

problem Stochastic linear bandits with high-dimensional sparse features.
method Derivation of minimax regret lower and upper bounds for explore-then-commit algorithm.
result Optimal rate of Θ(n2/3)Θ(n^{2/3}) for data-poor regime, complemented by O(n)O(\sqrt{n}) under signal magnitude assumption.

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.

IndiSeek learns disentangled representations by balancing independence and completeness.

problem Learning disentangled representations with mutual information in multi-modal data.
method Combines independence-enforcing objective with a reconstruction loss that bounds conditional mutual information.
result Demonstrates effectiveness on synthetic data, CITE-seq, and real-world multi-modal benchmarks.

Enhanced framework selects features for unbiased causal inference.

problem Unbiased estimation of causal quantities in causal inference.
method Three-stage computational framework balancing treatment and non-treatment variables.
result Significantly reduces bias and variance in estimating causal quantities.

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 ↗

Deep linear networks exhibit collapsing features and classifiers across datasets.

problem Understanding the collapse of features and classifiers in deep linear networks.
method Theoretical and empirical analysis of deep linear networks with MSE and CE losses.
result Deep linear networks exhibit NC properties, collapsing features and classifiers to orthogonal vectors.

Paper develops a dynamic Bayesian approach for active learning that optimizes exploration-exploitation balance.

problem Balancing exploration and exploitation in active learning for unknown functions.
method Develops BHEEM, a Bayesian hierarchical approach with approximate Bayesian computation for sampling trade-off parameters.
result BHEEM achieves at least 21% and 11% improvement over pure exploration and exploitation strategies respectively.

Study constructs balanced datasets for seismic failure prediction.

problem Imbalanced datasets limit machine learning performance in seismic failure prediction.
method Framework with three steps: GMF identification, probability density estimation, and sample transformation.
result Framework improves machine learning performance in seismic failure mode prediction.

SGD in DLNs reveals feature learning dynamics.

problem Understanding SGD dynamics in DLNs during saddle-to-saddle training.
method Stochastic Langevin dynamics with anisotropic, state-dependent noise; one-dimensional per-mode SDEs; Boltzmann distribution approximation.
result SGD noise encodes feature learning progression but does not alter saddle-to-saddle dynamics.

DINs use deep learning to optimize portfolio Sharpe ratio without manual feature engineering.

problem Optimizing Sharpe ratio for entire portfolios without manual feature engineering.
method Fully data-driven feature extraction from daily price returns, balancing turnover and systemic risk.
result DINs outperform traditional TS and CS benchmarks across various asset classes and transaction costs.

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.

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.

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 ↗

Random Forest variable importance is improved by class balancing techniques.

problem Class imbalance problem in machine learning.
method Proposed a variable selection algorithm using RF variable importance and its confidence interval.
result Our algorithm efficiently selects an optimal feature set, leading to improved prediction performance.

This paper investigates arbitrage chains involving four currencies and four foreign exchange trader-arbitrageurs. In contrast with the three-currency case, we find that arbitrage operations when four currencies are present may appear periodic in nature, and not involve smooth convergence to a "balanced" ensemble of exc…

2011-12-26abs ↗pdf ↗