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

Trend · papers per month

249497746994 · Jun 202019922001200920172026
48 results for balanced performance

Study examines how balancing methods affect model behavior in imbalanced classification problems.

problem Impact of balancing methods on model behavior in imbalanced classification problems.
method Used Explainable Artificial Intelligence tools (variable importance method, partial dependence profile, accumulated local effects) to compare model behavior before and after balancing.
result Significant changes in model behavior due to balancing methods, leading to biased models.

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.

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 ↗

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.

Balanced Activation improves object detection performance on long-tailed datasets.

problem Mismatch between training and testing label distributions in object detection.
method Introduces Balanced Activation (Balanced Softmax and Balanced Sigmoid) to address label distribution shift.
result Balanced Activation provides ~3% gain in mAP on LVIS-1.0 compared to state-of-the-art methods.

This study improves electricity price forecasting in the Irish balancing market.

problem Limited and inconsistent research on short-term price forecasting in volatile balancing markets.
method Compared statistical, machine learning, and deep learning models using a public dataset and framework.
result LEAR, a statistical approach, outperforms complex models in the balancing market.

Paper proposes ARB-Loss to improve classification precision in imbalanced datasets.

problem Improving classification precision on minor classes in imbalanced datasets.
method Introduces Attraction-Repulsion-Balanced Loss (ARB-Loss) to balance gradients across different classes.
result ARB-Loss achieves state-of-the-art performance with one-stage training.

CBDA improves active learning for semantic segmentation, especially with imbalanced classes.

problem Class imbalance degrades performance in domain adaptive active learning.
method Class Balanced Dynamic Acquisition (CBDA) selects more balanced labels for active learning.
result CBDA increases minority class performance and outperforms baselines by 0.6-2.4 mIoU.

This paper explores how balancing and filtering techniques affect predictive multiplicity in machine learning models.

problem Predictive multiplicity due to Rashomon effect in high-stakes environments.
method Investigates the impact of balancing and filtering techniques on predictive multiplicity using 21 real-world datasets.
result Data-centric AI strategies can mitigate predictive multiplicity, but preprocessing methods may introduce it.

FairACE improves fairness in GNNs by balancing node performance across degree groups.

problem Degree biases in GNNs lead to unequal prediction performance among nodes with varying degrees.
method Integrates asymmetric contrastive learning with adversarial training to balance performance between high-degree and low-degree nodes.
result Significantly improves degree fairness metrics while maintaining competitive accuracy.

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.

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.

Proposes a method to balance tasks in multitask learning with a single gradient step update.

problem Balancing tasks in multitask learning to avoid imbalance.
method Gradient-based meta-learning to balance tasks at the gradient level, training shared and task-specific layers separately.
result Achieves state-of-the-art performance on various multitask computer vision problems.

A new algorithm speeds up rerandomization for better experiment balance.

problem Achieving optimal covariate balance in randomized experiments.
method Metropolis-Hastings framework with sampling-importance resampling.
result PSRSRR achieves significant speedups while maintaining statistical guarantees.

Spectral Clustering as a relaxation of the normalized/ratio cut has become one of the standard graph-based clustering methods. Existing methods for the computation of multiple clusters, corresponding to a balanced kk-cut of the graph, are either based on greedy techniques or heuristics which have weak connection to th…

2015-05-24abs ↗pdf ↗

This study introduces balanced DRPS and OrderedLogitNN for better QDE of discrete-level questions.

problem Lack of ordinal regression methods and fair evaluation metrics for discrete-level QDE.
method Introduces balanced DRPS and OrderedLogitNN, fine-tunes BERT on RACE++ and ARC datasets.
result OrderedLogitNN outperforms other models on complex QDE tasks.

BOSS learns from one labeled sample per class to match fully supervised performance.

problem Achieving fully supervised performance with minimal labeled data.
method Combines class prototype refining, class balancing, and self-training.
result BOSS achieves comparable test accuracies to fully supervised learning.

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.

We test a historical price time series in a financial market (the NASDAQ 100 index) for a statistical property known as detailed balance. The presence of detailed balance would imply that the market can be modeled by a stochastic process based on a Markov chain, thus leading to equilibrium. In economic terms, a positiv…

2014-03-14abs ↗pdf ↗

TOPPO improves PPO for MTRL by balancing critic gradients, outperforming SAC.

problem Critic-side gradient ill-conditioning in PPO for MTRL.
method Critic Balancing modules to improve gradient conditioning and balance task updates.
result TOPPO achieves stronger mean and tail-task performance than SAC-family and ARS-family baselines.

A new random forest algorithm improves tree construction for optimal performance.

problem Improving the performance of random forests, especially in complex and smooth scenarios.
method Adaptive split-balancing method using permutation-based splitting criterion.
result Achieves minimax optimality under various Lipschitz and Hölder classes.

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.

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 ↗

In this paper, we propose a novel technique to implement stochastic gradient methods, which are beneficial for learning from large datasets, through accelerated stochastic dynamics. A stochastic gradient method is based on mini-batch learning for reducing the computational cost when the amount of data is large. The sto…

2015-11-19abs ↗pdf ↗

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.

Proposes a new framework for balancing average- and worst-case performance in machine learning.

problem Robustness issues in machine learning, especially in safety-critical domains.
method Probabilistic robustness framework that balances average- and worst-case performance.
result Effective algorithm balances average- and worst-case performance with lower computational cost.

In graph-based active learning, algorithms based on expected error minimization (EEM) have been popular and yield good empirical performance. The exact computation of EEM optimally balances exploration and exploitation. In practice, however, EEM-based algorithms employ various approximations due to the computational ha…

2016-09-03abs ↗pdf ↗

Variational inference improves training of generative flow networks.

problem Training generative flow networks efficiently and accurately.
method Define variational objectives in terms of KL divergences and optimize convex combinations.
result Variational inference methods can reduce the variance of gradients in training generative flow networks.

Proposes a novel neural network method to estimate average treatment effect.

problem Bias in estimating average treatment effect due to confounding and instrumental variables.
method Self-balancing neural network (Sbnet) that estimates pseudo propensity scores and average treatment effect in one step.
result Proposed method outperforms state-of-the-art methods in simulations and real-world datasets.

This paper visualizes uncertainty in classifier performance metrics.

problem Overemphasis on model performance metrics risks overlooking uncertainty.
method Developed visualizations of confusion matrix metric distributions.
result Uncertainty in performance metrics can overshadow model differences.

The ability to rank candidate architectures is the key to the performance of neural architecture search~(NAS). One-shot NAS is proposed to reduce the expense but shows inferior performance against conventional NAS and is not adequately stable. We investigate into this and find that the ranking correlation between archi…

2019-09-24abs ↗pdf ↗

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.