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

101202303404 · Jun 202019922001200920172026
48 results for mitigating limitations

This paper examines fairness and arbitrariness in bias mitigation methods.

problem Understanding how different bias mitigation strategies affect individual predictions and whether they introduce arbitrariness.
method FRAME framework to evaluate bias mitigation through five dimensions: Impact Size, Change Direction, Decision Rates, Affected Subpopulations, and Neglected Subpopulations.
result Significant differences in the behaviors of debiasing methods were exhibited, highlighting the limitations of current fairness criteria and the inherent arbitrariness in the debiasing process.

Paper discusses how financial institutions' model risk management can benefit academic research.

problem Improving academic research process and mitigating limitations.
method Adopting financial institutions' model risk management practices.
result Lessons from financial institutions can enhance academic research reliability.

Model shows how discount rates affect intergenerational equity in climate mitigation.

problem Intergenerational equity in climate mitigation decisions.
method Extended DICE model with stochastic discount rates and financing extensions.
result Discount-rate uncertainty amplifies intergenerational inequality in climate mitigation.

Modeling climate change costs with stochastic interest rates shows inequality, but funding abatement can reduce this.

problem Evaluating the costs and benefits of climate change mitigation with uncertain discount rates.
method Amended DICE model with stochastic interest rates and funding abatement costs.
result Introducing funding abatement can reduce intergenerational inequality in climate change costs.

Framework mitigates risk non-monotonicity in high-dimensional predictions.

problem Risk non-monotonicity in high-dimensional predictions.
method Model-agnostic framework using cross-validation and data-driven methodologies (zero- and one-step).
result Modified prediction procedures achieve monotonic asymptotic risk behavior.

Proposes a method to enforce fairness in machine learning models without sensitive data.

problem Bias in machine learning models from historical data.
method Infers sensitive attributes from auxiliary features and integrates fairness constraints into model training.
result Mitigates bias while preserving predictive accuracy.

New RL algorithm learns good actions from offline data, reducing uncertainty and divergence.

problem Limited applicability of current RL algorithms in real-world settings due to high costs of exploration.
method Proposes an algorithm for batch RL using a fixed offline dataset, with penalties for policy and value constraints.
result Compared favorably to state-of-the-art methods on 32 continuous-action benchmarks.

Survey finds many adversarial machine learning threats are not critical for most entities.

problem Adversarial machine learning threats and their impact on model accuracy.
method Literature review and analysis of real-world occurrences of adversarial attacks.
result Many adversarial machine learning threats do not warrant the cost of robust models.

Machine learning is vulnerable to adversarial examples: inputs carefully modified to force misclassification. Designing defenses against such inputs remains largely an open problem. In this work, we revisit defensive distillation---which is one of the mechanisms proposed to mitigate adversarial examples---to address it…

2017-05-15abs ↗pdf ↗

A new method forecasts hourly electricity prices considering product dynamics and limit order book signals.

problem High volatility and imbalance in power systems due to renewable energy and flexible demand.
method Incorporates short-term features from hourly and quarter-hourly products, including limit order book and neighboring product signals.
result Features from the limit order book are most influential, and neighboring product signals improve forecast accuracy.

Recent studies have highlighted adversarial examples as a ubiquitous threat to different neural network models and many downstream applications. Nonetheless, as unique data properties have inspired distinct and powerful learning principles, this paper aims to explore their potentials towards mitigating adversarial inpu…

2018-09-28abs ↗pdf ↗

New technique reduces bias in DNN models without sensitive attribute annotations.

problem Existing bias mitigation methods require instance-level annotations and do not guarantee removal of all sensitive information.
method Representation Neutralization for Fairness (RNF) debiases only the classification head of DNN models using neutralized representations.
result RNF effectively reduces discrimination of DNN models with minimal performance degradation.

New framework tackles fairness in link prediction beyond demographic parity.

problem Systemic biases in link prediction can exacerbate societal inequalities.
method Formalizes limitations of existing fairness evaluations and proposes a new framework.
result Proposes a lightweight post-processing method combined with decoupled link predictors.

Smooth DNNs mitigate the curse of dimensionality in uniform convergence for various regression tasks.

problem The curse of dimensionality in uniform convergence of ReLU networks.
method Analysis of smoothly activated deep neural networks (smooth DNNs), establishing pseudo-dimension bounds and non-asymptotic approximation guarantees.
result Smooth DNNs achieve non-asymptotic uniform convergence rates across multiple statistical contexts, mitigating the curse of dimensionality.

Improves model fairness under changing bias between labels and sensitive groups.

problem Fairness of models deteriorates when bias between labels and sensitive groups changes.
method Introduces correlation shifts to explicitly capture bias changes and proposes a pre-processing step to adjust data ratios.
result Our approach effectively improves model accuracy and fairness, both synthetic and real datasets.

Study shows annealing with adaptive schedule reduces mode collapse in NFs for parameter estimation.

problem Mode collapse in normalizing flows for multimodal distributions.
method Annealing with an adaptive schedule based on effective sample size (ESS).
result Our approach reduces mode collapse and converges marginal likelihood faster than MCMC methods.

UBM transfers bias mitigation from upstream to downstream tasks efficiently.

problem Bias in fine-tuned language models across various tasks.
method Apply bias mitigation to an upstream model, then fine-tune a downstream model on this mitigated model.
result UBM effects transfer to new downstream tasks, creating less biased models.

Selective reinitialization improves adaptability of neural bandits in dynamic environments.

problem Loss of plasticity in neural bandits, leading to rigid neural network parameters.
method Selective Reinitialization (SeRe) framework that dynamically resets underutilized units.
result SeRe enhances adaptability of CNB algorithms, reducing cumulative regret in dynamic environments.

ALFI improves likelihood-free inference for black-box generators.

problem Limitations of likelihood-free inference on black-box generators.
method Adversarial Likelihood-Free Inference (ALFI) to estimate posterior distributions.
result ALFI achieves best parameter estimation accuracy with limited simulation.

Study on deep multi-head self-attention dynamics, proving homogenized limits under specific scalings.

problem Understanding the behavior of deep multi-head self-attention models as depth increases.
method Random model of deep multi-head self-attention, viewing depth as time, and analyzing the residual stream as a particle system.
result Homogenized limit of the dynamics, leading to deterministic or stochastic behavior depending on scaling, with implications for representation collapse.

Study evaluates fairness of machine learning models on Kaggle and finds some optimization techniques can induce unfairness.

problem Ensuring fairness of machine learning models used in important decisions.
method Empirical evaluation of 40 top-rated models from Kaggle on 5 tasks, applying 7 mitigation techniques.
result Some model optimization techniques induce unfairness; mitigation in pre-processing is preferred.

Despite the high interest for Machine Learning (ML) in academia and industry, many issues related to the application of ML to real-life problems are yet to be addressed. Here we put forward one limitation which arises from a lack of adaptation of ML models and datasets to specific applications. We formalise a new notio…

2019-11-06abs ↗pdf ↗

Cloud computing is becoming increasingly popular as a platform for distributed training of deep neural networks. Synchronous stochastic gradient descent (SSGD) suffers from substantial slowdowns due to stragglers if the environment is non-dedicated, as is common in cloud computing. Asynchronous SGD (ASGD) methods are i…

2019-09-24abs ↗pdf ↗

SPARC improves continual learning with minimal memory and computational overhead.

problem Efficient continual learning for deep neural networks.
method Combines task-specific working memories and task-agnostic semantic memory.
result Significantly reduces parameter usage (6% of full-model surrogates) while maintaining performance.

In complex systems like financial market, risk tolerance of individuals is crucial for system resilience.The single-security price limit, designed as risk tolerance to protect investors by avoiding sharp price fluctuation, is blamed for feeding market panic in times of crash.The relationship between the critical market…

2019-08-20abs ↗pdf ↗

Analyzes self-attention in recurrent networks, proving it mitigates vanishing gradients.

problem Vanishing gradients in recurrent networks when capturing long-term dependencies.
method Formal analysis of self-attention's effect on gradient propagation, proposing a relevancy screening mechanism.
result Self-attention mitigates vanishing gradients in recurrent networks, providing guarantees.

Model improves CVR estimation in recommender systems by mitigating bias and overlooking causal relationships.

problem Data sparsity and sample selection bias in CVR estimation.
method Entire Space Counterfactual Multitask Model (ESCM2^2) incorporating counterfactual risk minimizer.
result Significantly enhances recommendation performance by effectively mitigating bias and overlooking causal relationships.

CFR-Pro enhances treatment effect estimation by incorporating local proximity.

problem Treatment selection bias in HTE estimation from observational data.
method Proximity-enhanced CounterFactual Regression (CFR-Pro) with pair-wise proximity regularizer and subspace projector.
result Significantly outperforms competitors in HTE estimation accuracy.

Diffusion models can memorize training data, limiting their creativity and privacy.

problem Memorization in diffusion models that reproduces training data instead of generating novel outputs.
method Dual-separation approach via statistical estimation and network approximation.
result Pruning-based method reduces memorization while maintaining generation quality.

This work identifies and mitigates reasoning shortcuts in Neuro-Symbolic models.

problem Neuro-Symbolic models can achieve high accuracy by using unintended concepts.
method Characterized reasoning shortcuts as unintended optima of the learning objective and identified four key conditions.
result Reasoning shortcuts are difficult to mitigate, casting doubt on NeSy solutions' trustworthiness and interpretability.

Study evaluates bias mitigation methods in deep learning, finds they often exploit hidden biases.

problem Deep learning systems learn biases, affecting performance on minority groups.
method Improved evaluation protocol, new dataset, robustness across different tuning distributions.
result Bias mitigation methods often exploit hidden biases, are not robust to multiple forms of bias, and are sensitive to tuning set choice.