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.

169,291 papers · 148 categories

Trend · papers per month

3468102136 · Oct 201919922001200920182026
48 results for human interventions

Method quantifies forest cover changes due to human activities using satellite data.

problem Quantify forest cover changes due to human activities.
method Computer vision, machine learning/deep learning, Bayesian structural causal model.
result Causal inference of forest cover changes due to human activities.

Study shows human advisors use context to improve student outcomes in algorithm-assisted advising.

problem How human advisors use context to guide interventions in algorithm-assisted advising.
method Mixed-methods approach combining quantitative and qualitative data from a randomized controlled trial.
result 2 out of 3 interventions by advisors were plausibly 'expertly targeted' to students using non-algorithmic context.

An approach for learning ancestral causal relationships in high dimensions, validated on human genome-wide data.

problem Learning ancestral causal relationships in high-dimensional biological data.
method Supervised learning approach with discrete indicators treated as labels, scalable to large problems.
result The approach is highly effective and scalable to the human genome-wide setting, robust to perturbations of input information.

RandomNet uses random search to design neural architectures without much human intervention.

problem Designing neural architectures without excessive human intervention.
method Random search strategy for multimodal neural architecture design.
result RandomNet performs close to state-of-the-art on AV-MNIST with minimal human supervision.

The paper explores fairness in machine learning by setting subgroup sample complexity bounds and advocating for human intervention.

problem Machine learning models often show different performance metrics for different subgroups, due to various factors.
method The paper presents lower bounds of subgroup sample complexity for metric-fair learning and proposes an approach using individual fairness definitions for cases where subgroup samples are insufficient.
result For a classifier to be fair, adequate subgroup population samples are necessary, and model dimensionality must align with subgroup population distributions.

This research integrates human interaction into reinforcement learning to improve sample efficiency and real-time learning.

problem Current reinforcement learning requires thousands of samples to converge, and is prone to catastrophic failures.
method Integrates human interaction modalities (demonstrations, interventions, evaluations) into the reinforcement learning loop.
result Human interaction accelerates learning and improves sample efficiency.

Discovering causal relationships is a hard task, often hindered by the need for intervention, and often requiring large amounts of data to resolve statistical uncertainty. However, humans quickly arrive at useful causal relationships. One possible reason is that humans extrapolate from past experience to new, unseen si…

2011-11-03abs ↗pdf ↗

A new approach to fraud detection minimizes human intervention.

problem Minimizing the number of non-fraudulent operations requiring human verification.
method Computer-assisted fraud detection using a meta-algorithm to minimize oracle calls.
result A simple meta-algorithm provides competitive results in minimizing non-fraudulent operations.

Framework uses expert intervention to solve long-horizon reinforcement learning tasks.

problem Long horizon robot learning tasks with sparse rewards.
method Option templates and expert intervention to enable high-level task understanding.
result Framework outperforms state-of-the-art approaches by two orders of magnitude.

SSFN self-estimates network size with low complexity and consistent performance.

problem Designing a self-estimating feed-forward network with low complexity and consistent performance.
method Joint optimization for layer and node estimation, low computational complexity, and use of lossless flow property and convex optimization.
result Consistent performance across Monte-Carlo trials and monotonically non-increasing cost with network growth.

Adversarial method learns inverse dynamics models without human intervention.

problem Learning inverse dynamics models in robotics without expert demonstrations.
method Adversarial active exploration framework combining DRL and inverse dynamics model.
result Our method learns effective inverse dynamics models comparable to expert demonstrations.

FairPrep aims to improve fairness in machine learning by providing best practices.

problem Lack of best practices in fairness-enhancing interventions.
method Developer-centered design and evaluation framework for fairness-enhancing interventions.
result Hyperparameter tuning and data cleaning methods impact fairness outcomes.

Optimal allocation of human effort to correct AI assessments in decision-making.

problem How to allocate costly human effort to correct noisy or biased AI-generated assessments.
method Decision-theoretic framework treating AI assessments as signals and human judgments as costly information. Developed estimation procedures under nonparametric and linear models.
result Our approach substantially outperforms LLM-only predictions and achieves performance comparable to full human review while using only 20-30% of the human information.

Automated protein structure prediction from cryo-EM data.

problem Challenging to build atomic models from cryo-EM densities without prior structure.
method Uses GCN and LSTM to automate model building from amino acid identities and candidate locations.
result Automated approach reduces time and eliminates human intervention for protein structure determination.

Proposes a model to estimate treatment effects in complex multiagent systems over time.

problem Challenges in evaluating interventions in multiagent systems, especially with time-varying relationships and covariates.
method Interpretable counterfactual recurrent network leveraging graph variational recurrent neural networks and domain knowledge.
result Achieved lower estimation errors and more effective treatment timing than baselines in simulated and real-world scenarios.

Study reduces human labeling in LLM-based classification systems.

problem Minimizing human intervention in training LLM-based classification systems.
method Active learning framework with Conservative Hull-based Classifier (CHC), Center-based Classifier (CC), and Generalized Hull-based Classifier (GHC).
result CHC achieves O(logdT)\mathcal{O}(\log^d T) regret and is minimax optimal for d=1d=1. GHC bridges the gap between different regimes.

AGENTICAITA uses AI agents to autonomously trade markets without human intervention.

problem Inability of traditional trading systems to adapt to market complexity.
method Introduces an agentic AI framework with specialized LLM agents reasoning, negotiating, and acting.
result Demonstrated operational correctness and non-trivial inter-agent negotiation in live market conditions.

ReRe detects anomalies in real-time for time series data.

problem Real-time anomaly detection for time series data requires human intervention or domain knowledge and high computation complexity.
method ReRe uses two lightweight LSTM models to predict and determine anomalies based on historical data and adaptive thresholds.
result ReRe detects anomalies in real-time without requiring human intervention or domain knowledge.

An algorithm detects anomalies based on human perception principles.

problem Anomaly detection in data.
method Inspired by Gestalt psychology and Helmholtz principle, the algorithm models anomalies as unexpected elements in random distributions.
result The algorithm efficiently detects anomalies with minimal user intervention and promising results on multivariate data.

Interactive machine learning with human input tackles complex problems like the Traveling Salesman Problem.

problem Complex NP-hard problems in health informatics with limited data.
method Interactive machine learning (iML) with a human-in-the-loop to solve the Traveling Salesman Problem (TSP).
result Demonstrates effectiveness of iML in making machine learning transparent and interactive.

New study finds targeting based on treatment effects outperforms risk-based targeting in social interventions.

problem Lack of accurate treatment effect estimates for machine learning-based targeting in social domains.
method Empirical assessment of targeting strategies using data from 5 real-world RCTs in various domains.
result Treatment effect-based targeting outperforms risk-based targeting, even with biased estimates.

Study reveals LLM personality patterns but lacks behavioral consistency.

problem Understanding and validating personality traits in LLMs.
method Characterized LLM personality across three dimensions: training dynamics, self-report validity, and intervention effects.
result Self-reported traits do not reliably predict behavior, and instructional alignment affects trait expression but not behavior.

Estimates joint causal effects using single-variable interventions on nonlinear models.

problem Estimating joint causal effects from single-variable interventions.
method Identifiability result and practical estimator for decomposing causal effects.
result Joint effects can be inferred without joint interventional data for nonlinear additive models.

Concept-driven OPE reduces variance in off-policy decision evaluation.

problem High variance in off-policy decision evaluation due to limited sample sizes.
method Integrating human-explainable concepts into OPE to reduce variance.
result Concept-based OPE estimators remain unbiased and reduce variance when concepts are known and predefined.

Introduces info intervention to handle causal questions and check counterfactual variables.

problem Controversial interpretation of causal questions for non-manipulable variables and lack of power to check counterfactual variables.
method Intervenes input/output information of causal mechanisms, providing causal diagrams for communication and theoretical focus.
result Causal diagrams based on info intervention provide a new perspective on information transfer as causality.

This paper tackles CRL for multi-node interventions, achieving identifiability guarantees.

problem CRL under unknown multi-node interventions, focusing on single-node assumptions.
method Establishes identifiability results for general latent causal models under stochastic interventions.
result Identifiability up to ancestors using soft interventions, perfect identifiability using hard interventions.

This work tackles causal graph discovery with stochastic interventions to minimize the number of interventions.

problem Discovering the true causal graph from observational data with limited interventions.
method Proposes a stochastic intervention model and studies verification and search problems with approximation algorithms.
result Provides approximation algorithms with competitive ratios for verification and search problems.

DeepSoft aims to model software development for risk prediction and intervention.

problem Manual feature engineering and traditional classification problems in software analytics.
method End-to-end deep learning framework using Long Short Term Memory architecture.
result DeepSoft predicts future risks and recommends interventions in software development.

New method extracts biological concepts from cell microscopy images.

problem Extracting meaningful concepts from vision foundation models trained on cell microscopy images.
method Sparse dictionary learning (DL) combined with PCA whitening pre-processing.
result Successfully retrieved biologically meaningful concepts like cell types and genetic perturbations.

Our goal is to identify beneficial interventions from observational data. We consider interventions that are narrowly focused (impacting few covariates) and may be tailored to each individual or globally enacted over a population. For applications where harmful intervention is drastically worse than proposing no change…

2016-06-16abs ↗pdf ↗

Paper proposes scalable algorithm to estimate intervention targets in linear models.

problem Estimating intervention targets in linear models from observational and interventional data.
method The paper proposes a scalable algorithm that estimates intervention sites from the difference between precision matrices of observational and interventional datasets.
result The algorithm consistently identifies all intervention targets and updates observational Markov equivalence classes to interventional ones.

ReCoRe learns invariant features for world navigation using contrastive learning and regularizers.

problem Limited sample efficiency and overfitting to training scenarios in RL for visual navigation.
method Contrastive unsupervised learning and intervention-invariant regularizer.
result Significantly improves sample efficiency and generalization in out-of-distribution point navigation tasks.