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

Trend · papers per month

2925848761,168 · Jun 202019922001200920172026
48 results for biased data collection

New method learns collective variables using autoencoders for molecular simulations.

problem Learning low-dimensional slow degrees of freedom (collective variables) for molecular simulations.
method Iterative method involving CV learning with autoencoders and reweighting scheme.
result Achieves convergence of learned collective variables.

Improves likelihood-free inference by using a new sampling approach to avoid biased data collection.

problem Efficient Bayesian inference without likelihood evaluation for real-world datasets.
method Introduces Neural Proposal (NP) to sample simulation inputs i.i.d. for unbiased posterior inference.
result Demonstrates improved performance, especially for multi-modal posteriors, through experiments.

Many machine learning algorithms are trained and evaluated by splitting data from a single source into training and test sets. While such focus on in-distribution learning scenarios has led to interesting advancement, it has not been able to tell if models are relying on dataset biases as shortcuts for successful predi…

2019-10-07abs ↗pdf ↗

Post-ADC inference corrects bias in statistical inference after active data collection.

problem Bias in inference after active data collection.
method Post-ADC inference framework that corrects bias from both ADC process and data-driven target construction.
result Valid inference for data collected by SMBO methods like GP-UCB and TPE.

Machine learning models learn what we teach them to learn. Machine learning is at the heart of recommender systems. If a machine learning model is trained on biased data, the resulting recommender system may reflect the biases in its recommendations. Biases arise at different stages in a recommender system, from existi…

2019-05-10abs ↗pdf ↗

The paper tackles sampling biases by ensuring minority groups are adequately represented in training data.

problem Sampling biases in training data lead to algorithmic biases in machine learning systems.
method The paper presents adaptive sampling methods to determine if it's possible to assemble a representative dataset from given data sources.
result The methods presented can determine with high confidence if a representative dataset can be assembled from given data sources.

Study optimizes data collection from biased, costly sources to minimize risk.

problem Estimating population means and group-conditional means from multiple sources with varying costs and biases.
method Develops a sampling plan that maximizes effective sample size, paired with a post-stratification estimator.
result Achieves budgeted minimax optimal risk for estimating population means and group-conditional means.

Estimators computed from adaptively collected data do not behave like their non-adaptive brethren. Rather, the sequential dependence of the collection policy can lead to severe distributional biases that persist even in the infinite data limit. We develop a general method -- W\mathbf{W}-decorrelation -- for transformi…

2017-12-18abs ↗pdf ↗

CausalSim corrects bias in trace-driven simulations for more accurate results.

problem Bias in trace-driven simulations due to system conditions during trace collection.
method CausalSim learns a causal model of system dynamics and latent factors from an RCT to remove bias from trace data.
result CausalSim reduces simulation errors by 53% and 61% compared to baselines, providing more accurate insights.

Study shows how online personalization can lead to unfair models due to biased user responses.

problem Fairness issues in online personalization systems due to biased user responses.
method Formulated a regularization-based approach to mitigate biases in machine learning models.
result Demonstrated that online personalization can cause models to learn unfair behavior from biased user responses.

In binary classification, there are situations where negative (N) data are too diverse to be fully labeled and we often resort to positive-unlabeled (PU) learning in these scenarios. However, collecting a non-representative N set that contains only a small portion of all possible N data can often be much easier in prac…

2018-10-01abs ↗pdf ↗

Systematic discriminatory biases present in our society influence the way data is collected and stored, the way variables are defined, and the way scientific findings are put into practice as policy. Automated decision procedures and learning algorithms applied to such data may serve to perpetuate existing injustice or…

2018-09-06abs ↗pdf ↗

New validation method prevents privacy breaches and biases in federated learning.

problem Privacy breaches and data leakage in federated learning.
method Stratified cross-validation for unbiased and privacy-preserving federated learning.
result Stratified cross-validation prevents data leakage without demanding deduplication algorithms.

Industrial recommender systems deal with extremely large action spaces -- many millions of items to recommend. Moreover, they need to serve billions of users, who are unique at any point in time, making a complex user state space. Luckily, huge quantities of logged implicit feedback (e.g., user clicks, dwell time) are …

2018-12-06abs ↗pdf ↗

This study examines how learning algorithms affect collective action in machine learning.

problem The impact of collective action on machine learning is limited when not considering the choice of learning algorithms.
method Focuses on distributionally robust optimization and stochastic gradient descent, analyzing their effects on collective success.
result The choice of learning algorithm significantly impacts the effective size and success of a collective in machine learning.

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.

The paper tackles bandit problems with biased offline data by using causal methods.

problem Improving bandit algorithms with biased offline data that includes confounding and selection biases.
method Formalizes the problem from a causal perspective, categorizes biases, and derives robust bounds for each arm.
result Causal bounds can guide the bandit agent to learn a nearly-optimal decision policy and consistently reduce asymptotic regret.

New online method for statistical inference with matrix context in decision-making.

problem Statistical inference in decision-making with matrix context.
method Proposes a fully online procedure to conduct statistical inference with adaptive data collection, handling low-rank structure.
result Establishes asymptotic normality of debiased estimators and proves validity of confidence intervals.

The paper proposes a method to align AI models using conformal risk control.

problem Aligning AI models to meet end-user requirements in non-generative settings.
method Post-processing a pre-trained model to better align with a subset of functions using conformal risk control.
result A probabilistic guarantee that the resulting conformal interval around a model contains a function approximately satisfying a desired property.

Gradient-based methods can be biased by distributional asymmetries in bivariate categorical data.

problem Gradient-based causal discovery methods can be biased by distributional asymmetries in bivariate categorical data.
method Identified and examined two distributional biases: Marginal Distribution Asymmetry and Marginal Distribution Shift Asymmetry. Employed two simple models to demonstrate and control these biases.
result Gradient-based methods can be biased by distributional asymmetries, and these biases can be controlled.

Data collection in economically constrained countries often necessitates using approximate and biased measurements due to the low-cost of the sensors used. This leads to potentially invalid predictions and poor policies or decision making. This is especially an issue if methods from resource-rich regions are applied wi…

2019-11-28abs ↗pdf ↗

Experiment shows cognitive biases impact human-AI collaboration, highlighting the need for diverse evaluator samples.

problem Cognitive biases affect human-AI collaboration, leading to suboptimal outcomes.
method Randomized experiment with 2,784 participants, manipulating AI suggestion quality, task burden, and financial incentives.
result Individual attitudes toward AI are the strongest predictor of performance, influencing accuracy and overcorrection.

Paper explores how knowledge distillation transfers inductive biases between models.

problem Transferring inductive biases between models for tasks with limited data.
method Knowledge distillation applied to models with different inductive biases (LSTMs vs. Transformers, CNNs vs. MLPs).
result Effect of inductive biases is transferred through knowledge distillation, impacting both performance and solution characteristics.

Proposes a new Hawkes process bandit model for disaster search and rescue.

problem Forecasting and detecting spatio-temporal events with undersampled or biased data.
method Upper confidence bound algorithm using Bayesian spatial Hawkes process estimation.
result Model outperforms state-of-the-art spatial MAB algorithms in disaster search and rescue.

Data that is gathered adaptively --- via bandit algorithms, for example --- exhibits bias. This is true both when gathering simple numeric valued data --- the empirical means kept track of by stochastic bandit algorithms are biased downwards --- and when gathering more complicated data --- running hypothesis tests on c…

2018-06-06abs ↗pdf ↗

The study examines machine learning classification algorithms and their generalizability using Framingham Heart Study data.

problem Addressing biases and generalizability issues in machine learning classification algorithms.
method Comparison of eight machine learning classification algorithms on Framingham Heart Study data.
result Double discriminant scoring of type I is the most generalizable algorithm.

New framework embeds physics in coarse-grained models without big data.

problem Lack of big data and computational demand in data-driven coarse-graining.
method Proposes a novel objective based on reverse Kullback-Leibler divergence that incorporates physics in the form of force fields.
result Generative coarse-grained model predicts atomistic configurations and reveals physicochemical CVs.

Study shows statistical biases can mislead transformer models, impairing their generalization.

problem Statistical biases in transformers affect their ability to generalize.
method Evaluated transformer models on synthetic algorithmic tasks with varying statistical biases.
result Statistical biases lead to overestimation of transformer models' generalization capabilities.