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

13253850 · May 202619922001200920172026
48 results for incremental interventions

Unified multilinear model for causal factor disentanglement.

problem Disentangling causal factors from complex data without direct manipulation.
method Hierarchical block multilinear factorization (M-mode Block SVD) and incremental approach.
result Interpretable object representation robust to occlusion and reduced training data.

IUPM monitors machine learning models under gradual shifts using optimal transport and active labeling.

problem Gradual distribution shifts lead to unnoticed accuracy declines in machine learning models.
method Incremental Uncertainty-aware Performance Monitoring (IUPM) using optimal transport and active labeling.
result IUPM outperforms existing baselines in gradual shift scenarios and guides label acquisition more effectively.

We introduce incremental variational inference and apply it to latent Dirichlet allocation (LDA). Incremental variational inference is inspired by incremental EM and provides an alternative to stochastic variational inference. Incremental LDA can process massive document collections, does not require to set a learning …

2015-07-17abs ↗pdf ↗

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.

Time and Sales of corn futures traded electronically on the CME Group Globex are studied. Theories of continuous prices turn upside down reality of intra-day trading. Prices and their increments are discrete and obey lattice probability distributions. A function for systematic evolution of futures trading volume is pro…

2017-04-03abs ↗pdf ↗

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.

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 ↗

Paper tackles few-shot class-incremental learning with a neural gas network.

problem Incrementally learn new classes from very few labelled samples without forgetting old classes.
method Proposes TOPIC framework using a neural gas network to preserve class topology and adapt to new samples.
result Significantly outperforms other methods on CIFAR100, miniImageNet, and CUB200 datasets.

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.

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.

A new model learns preferences incrementally without personal data.

problem Incremental session-based recommendation without personal data.
method Memory Augmented Neural model (MAN) that combines a neural recommender with a nonparametric memory.
result MAN consistently outperforms existing methods in incremental session-based recommendation.

Incremental versions of batch algorithms are often desired, for increased time efficiency in the streaming data setting, or increased memory efficiency in general. In this paper we present a novel algorithm for incremental kernel PCA, based on rank one updates to the eigendecomposition of the kernel matrix, which is mo…

2018-01-31abs ↗pdf ↗

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.

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.

This paper introduces Deep Incremental Boosting, a new technique derived from AdaBoost, specifically adapted to work with Deep Learning methods, that reduces the required training time and improves generalisation. We draw inspiration from Transfer of Learning approaches to reduce the start-up time to training each incr…

2017-08-11abs ↗pdf ↗

Paper proposes CNE-net to tackle incremental learning in (T)ACSA tasks.

problem Catastrophic forgetting in multi-task incremental learning for (T)ACSA.
method Category Name Embedding network (CNE-net) with shared encoder and decoder.
result State-of-the-art performance on (T)ACSA benchmark datasets.

This paper presents a novel approach for incremental semiparametric inverse dynamics learning. In particular, we consider the mixture of two approaches: Parametric modeling based on rigid body dynamics equations and nonparametric modeling based on incremental kernel methods, with no prior information on the mechanical …

2016-01-18abs ↗pdf ↗

GraphSAIL updates GNN-based recommender models incrementally to reduce computation time and improve frequent updates.

problem Incremental updates in GNN-based recommender systems are computationally expensive and prone to forgetting.
method GraphSAIL uses a graph structure preservation strategy to update GNN models incrementally, preserving long-term preferences and properties.
result GraphSAIL reduces computation time and improves frequent updates compared to other incremental learning techniques.

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.

Data is continuously generated by modern data sources, and a recent challenge in machine learning has been to develop techniques that perform well in an incremental (streaming) setting. In this paper, we investigate the problem of private machine learning, where as common in practice, the data is not given at once, but…

2017-01-04abs ↗pdf ↗

We analyze the question whether sliding window time averages applied to stationary increment processes converge to a limit in probability. The question centers on averages, correlations, and densities constructed via time averages of the increment x(t,T)=x(t+T)-x(t)and the assumption is that the increment is distribute…

2008-04-06abs ↗pdf ↗

Method learns causal effects from multiple interventions in presence of unobserved confounders.

problem Disentangling causal effects from sets of interventions in the presence of unobserved confounders.
method Non-linear structural causal models with additive, multivariate Gaussian noise; algorithm that learns causal model parameters by pooling data from different regimes and maximizing combined likelihood.
result Identification proofs demonstrate that causal effects of single interventions can be learned from sets of interventions, even with unobserved confounders.

New algorithms improve causal graph discovery with adaptive interventions, even under worst-case interventional costs.

problem Discover causal relationships from data with adaptive interventions and node-dependent costs.
method Define new benchmarks and provide adaptive search algorithms for causal graph discovery.
result Logarithmic approximations achieved under various settings: atomic, bounded size interventions and generalized cost objectives.

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.

New algorithm improves on EM for streaming data, outperforming existing methods.

problem Processing high-volume, streaming data efficiently.
method Incremental stochastic Majorization-Minimization (MM) algorithm.
result The algorithm converges to a stationary point with vanishing gradient.

Paper relaxes faithfulness assumption for causal discovery using interventions.

problem Violation of faithfulness assumption in natural systems leads to incorrect causal structure identification.
method Use intervention-immediacy faithfulness assumption to identify causal structures with hard interventions.
result Interventions contain information about causal structure that can identify causal structures when faithfulness is violated.

FMI uses matching to mimic interventions for causal feature learning.

problem Challenges in causal discovery from observational data.
method Feature Matching Intervention (FMI) using matching to emulate perfect interventions.
result FMI outperforms in identifying causal features from observational data.

Graph-coupled causal Bayesian optimization transfers information across related interventions.

problem Optimizing expensive systems where interventions are costly and causal effects are confounded.
method Ties intervention effects together through shared causal parameters, improving estimation.
result Information-gain and regret bounds show improved performance with shared mechanisms.

The paper tackles matching a desired mean in causal systems through shift interventions.

problem Matching a desired mean in causal systems.
method Defining Markov equivalence classes, proposing active learning strategies, deriving lower bounds.
result Proposed active learning strategies require fewer interventions than previous approaches, especially for certain graph classes.

It was recently shown that architectural, regularization and rehearsal strategies can be used to train deep models sequentially on a number of disjoint tasks without forgetting previously acquired knowledge. However, these strategies are still unsatisfactory if the tasks are not disjoint but constitute a single increme…

2018-06-22abs ↗pdf ↗

Model identifies causal structure from paired observational and interventional data with unknown soft interventions.

problem Identifying causal structure from observational and interventional data with unknown soft interventions.
method Proposes a scalable causal discovery model that aggregates subset-level PDAGs and applies contrastive cross-regime orientation rules.
result The model asymptotically recovers the identifiable PDAG and can orient additional edges compared to non-contrastive subset-restricted methods.

Tensor decompositions are invaluable tools in analyzing multimodal datasets. In many real-world scenarios, such datasets are far from being static, to the contrary they tend to grow over time. For instance, in an online social network setting, as we observe new interactions over time, our dataset gets updated in its "t…

2017-09-03abs ↗pdf ↗