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

70139209278 · Jun 202019922001200920172026
48 results for minimal interventions

New algorithms for efficient causal interventions with budget constraints and without constraints.

problem Efficiently learning best interventions in causal graphs with budget constraints.
method Developed algorithms for both budgeted and non-budgeted causal bandits, optimizing regret and side-information usage.
result Proposed algorithms minimize cumulative regret and perform better than standard methods.

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.

This paper identifies the minimal set of nodes for optimal conditional interventions in causal bandits.

problem Optimizing decision-making in causal bandits with conditional interventions.
method Graphical characterization and efficient algorithm to identify the minimal set of nodes.
result The proposed algorithm significantly prunes the search space and accelerates convergence rates.

Extended LPCMCI learns causal models from interventional data to minimize prediction error.

problem Optimizing prediction of target variables using causal models.
method Combining observational and interventional causal discovery methods.
result Extended LPCMCI allows 60.9% optimal prediction of target variables compared to 53.6% with original LPCMCI.

The paper presents efficient methods for identifying causal graphs with latent variables.

problem Recovering causal graphs with latent variables while minimizing intervention costs.
method Two intervention cost models (linear and identity) are considered. Algorithms are provided for both models.
result Upper bounds on the number of interventions needed for recovery, and approximation factors for the linear cost model.

New algorithm reduces interventional strategy complexity for causal graph discovery.

problem Designing efficient interventional strategies for causal graph discovery.
method Developed an r-adaptive algorithm for causal graph discovery that minimizes the number of interventions.
result Achieved an approximation of O(min{r, log n} * n^{1/min{r, log n}}) for the verification number.

GIT uses gradient estimators to target interventions for causal discovery.

problem Challenges in inferring causal structure from observational data.
method GIT uses gradient estimators to target interventions for causal discovery.
result GIT performs on par with competitive baselines, surpassing them in low-data regimes.

Proposes minimal interventions over counterfactual explanations for algorithmic recourse.

problem Lack of actionable recommendations for algorithmic recourse.
method Causal reasoning to shift focus from explanations to recommendations.
result Minimal interventions provide more actionable recommendations for recourse.

Efficient algorithms learn causal graphs with minimal interventions.

problem Learning causal relationships between observed variables in the presence of latents.
method Bi-criteria approximation goal combining intervention design and graph property testing.
result Achieve intervention cost within a small constant factor of the optimal.

Statistical test evaluates if personalizing interventions is cost-effective.

problem Balancing the benefits of personalizing interventions with their potential costs.
method Developed a statistical hypothesis test to assess the performance of personalized interventions.
result The test shows that personalized interventions can outperform standard approaches under certain conditions.

Optimizes intervention design for causal discovery using integer programming.

problem Identifying causal structures from observational data due to confounding variables.
method Uses integer programming to design minimal intervention sets for causal structure identifiability.
result Provides exact and modular solutions adaptable to various experimental settings and constraints.

MO-CBO optimizes multiple outcomes in causal systems with minimal data.

problem Optimizing multiple outcomes in causal systems with limited data.
method Decomposes MO-CBO into multi-objective optimization tasks and uses relative hypervolume improvement for sequential intervention balancing.
result MO-CBO outperforms traditional multi-objective Bayesian optimization in causal settings.

Study efficient algorithms for identifying minimum interventional sets to learn causal relationships.

problem Identify the smallest set of interventions to learn causal relationships between a subset of edges.
method Develop algorithms for subset verification and search problems under assumptions of faithfulness, causal sufficiency, and ideal interventions.
result For subset verification, an efficient algorithm is provided to compute a minimum sized interventional set.

Paper recovers latent causal structure and linear transformation from indirect observations.

problem Recovering latent causal structure and linear transformation from indirect observations.
method Established sufficient conditions for DAG recovery, leveraged score function properties, and used soft/hard interventions.
result Perfect recovery of latent DAG structure and linear transformation up to scaling using soft interventions, hard interventions with additional hypothesis testing.

Paper tackles confounded ANMs, estimating ACEs with minimal interventions.

problem Estimating causal effects in the presence of unobserved confounders.
method Interventional distributions and randomized algorithm to reduce the number of required interventions.
result Poly-logarithmic number of interventions sufficient to infer causal effects in confounded ANMs.

This work sets a universal lower bound for learning causal DAGs with atomic interventions.

problem Learning causal DAGs using only observational data results in a Markov equivalence class, requiring interventions to fully orient.
method Developed CBSP orderings and used them to prove a universal lower bound on the number of single-node interventions needed.
result The universal lower bound is within a factor of two of the minimum number of single-node interventions required to fully orient a given Markov equivalence class.

This paper tackles causal interactions in mixtures of DAGs using interventions.

problem Learning causal interactions among variables governed by a mixture of causal systems.
method Establishes necessary and sufficient conditions for intervention size, designs an adaptive algorithm.
result Identifies true edges in a mixture of DAGs using optimal or near-optimal interventions.

The paper tackles causal bandits with unknown SCMs and soft interventions, providing upper and lower bounds on regret.

problem Optimizing interventions in a causal system with unknown SCMs and soft interventions.
method Assumes unknown SCMs from a general class, allows infinite interventions, and provides upper and lower bounds on regret.
result General upper and lower bounds on cumulative achievable regret for various SCMs.

The paper tackles causal bandits for SEMs, proposing algorithms that avoid estimating 2N2^N reward distributions.

problem Designing an optimal sequence of interventions in causal graphical models to minimize cumulative regret.
method Proposes two algorithms for causal bandits for linear structural equation models (SEMs), avoiding the estimation of 2N2^N reward distributions.
result Cumulative regrets scale as ildeO(dL+12NT) ilde{\cal O} (d^{L+\frac{1}{2}} \sqrt{NT}) under bounded noise and parameter space.

PULSE estimator improves prediction in causal inference with bounded interventions.

problem Optimizing causal models for bounded interventions.
method Relates K-class estimators to anchor regression, introduces PULSE estimator for minimization of mean squared prediction error with bounded constraints.
result PULSE estimator outperforms other estimators in real data and simulation experiments, especially in weak instrument settings.

The paper proposes a method to measure fairness through equality of effort using algorithmic recourse.

problem Measuring fairness through equality of effort in automated systems.
method Applying algorithmic recourse to quantify equality of effort, overcoming previous limitations.
result An algorithm for assessing equality of effort has been developed and validated.

Proposes DRIG for robust predictions using noise interventions.

problem Developing robust prediction models against distribution shifts.
method Distributional Robustness via Invariant Gradients (DRIG) exploiting general noise interventions.
result DRIG yields robust predictions among a data-dependent class of distribution shifts.

GANICE improves GAN-based causal inference by minimizing averaged Wasserstein risk.

problem Estimating interventional outcome distributions and quantiles in causal inference.
method GANICE uses extended Wasserstein distance and a cellwise critic to minimize averaged Wasserstein risk.
result GANICE achieves minimax optimality and consistently outperforms existing methods.

The paper tackles intervention generalization using factor graph models.

problem Generalizing from past experiments to novel conditions is hard due to combinatorial space of possible interventions.
method The approach is based on intervention factor models (IFMs) and factor graph models.
result Conditions for identifiability of expected outcomes of new regimes are derived.

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.

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.

Causal diagrams based on do intervention are useful tools to formalize, process and understand causal relationship among variables. However, the do intervention has controversial interpretation of causal questions for non-manipulable variables, and it also lacks the power to check the conditions related to counterfactu…

2019-07-24abs ↗pdf ↗

New classifiers ensure fairness by adjusting a base classifier's operating characteristics.

problem Ensuring fairness in binary classification with multiple group constraints.
method Intervening directly on a base classifier's operating characteristics using group-wise ROC convex hulls and post-processing.
result Methods satisfy multiple fairness constraints (DP, EO, PP) with minimal interventions and near-oracle accuracy.

Adapts causal inference for high-dimensional treatments like text strings.

problem Predicting effects of interventions with many possible variations.
method Adapts classical causal estimators to high-dimensional treatment spaces, balancing moment errors.
result Shows high-dimensional treatment spaces can be addressed with a single model.

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.

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 ↗

We consider the problem of learning causal networks with interventions, when each intervention is limited in size under Pearl's Structural Equation Model with independent errors (SEM-IE). The objective is to minimize the number of experiments to discover the causal directions of all the edges in a causal graph. Previou…

2015-10-30abs ↗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.

New algorithms optimize decision rules in strategic scenarios, minimizing prediction risk and incentivizing better outcomes.

problem Strategic agents manipulate features to improve outcomes, complicating decision-making models.
method Efficient algorithms for learning decision rules that minimize prediction risk, incentivize better outcomes, and estimate true model coefficients.
result Optimal decision rules can be learned through testing and observing agent responses, circumventing hardness results.

This paper extends stable blanket theory to models with hidden variables and causal cycles.

problem Identifying stable predictors in models with hidden variables and causal cycles.
method Use acyclic directed mixed graphs (ADMGs) and directed graphs (DGs) with mm-separation and σσ-separation to characterize and construct intervention-stable predictor sets.
result Graphical characterizations of Markov blankets, stable frontiers, and stable blankets in models with hidden variables and cycles.

New method disentangles mixed interventional and observational data in SEMs.

problem Learning causal relationships from mixed interventional and observational data.
method Developed a method to disentangle mixed interventional and observational data in linear SEMs with Gaussian noise.
result The method can identify causal graphs up to their interventional Markov Equivalence Class.

The paper presents a method to estimate joint interventional distributions from marginal interventional data.

problem Estimating joint interventional distributions from marginal interventional data.
method The paper extends the Causal Maximum Entropy method to use interventional data and employs Lagrange duality to prove the solution lies in the exponential family.
result The method allows for causal feature selection and inference of joint interventional distributions.

Recurring international financial crises have adverse socioeconomic effects and demand novel regulatory instruments or strategies for risk management and market stabilization. However, the complex web of market interactions often impedes rational decisions that would absolutely minimize the risk. Here we show that, for…

2009-08-05abs ↗pdf ↗

Bayesian method for causal discovery from unknown general interventions.

problem Learning causal DAGs from unknown interventions that modify parent sets.
method Bayesian approach with MCMC for approximating posterior DAGs and intervention targets.
result Bayesian method can identify DAGs and intervention targets up to equivalence classes.

Interventional data helps identify latent factors without distributional assumptions.

problem Identifying latent factors from interventional data without distributional assumptions.
method Leveraging geometric signatures of latent factors' support from interventional data.
result Latent causal factors can be identified up to permutation and scaling given data from perfect do-interventions.

IntDC framework uncovers causal relationships from non-interventional data.

problem Detecting causal relationships in non-interventional complex systems.
method Interventional Embedding Entropy (IEE) for causal strength measurement.
result IEE accurately finds causal edges and quantifies causal strength robustly.

Algorithm detects causal change points quickly with adaptive interventions.

problem Detecting changes in causal models with interventions.
method Centralization technique, Kullback-Leibler divergence for intervention selection, adaptive intervention policy.
result Theoretical first-order optimality and validation through simulations and real-world studies.