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

Trend · papers per month

25.0%50.0%75.0%100.0% · Jul 199219922001200920172026
48 results for independence of mechanisms

RIMs improve generalization by specializing modular structures.

problem Improving generalization and robustness to changes in tasks.
method Recurrent Independent Mechanisms (RIMs) architecture with independent dynamics, sparing communication, and selective updates.
result RIMs lead to dramatic improvement in generalization on tasks with varying factors.

The paper tackles extrapolation in generative models by enforcing independence of mechanisms.

problem How to make generative models extrapolate to new, unseen environments?
method Developed a theoretical framework for independence of mechanisms, demonstrated on toy examples and real-world data.
result Extrapolation capabilities of generative models can be improved by enforcing independence of mechanisms explicitly during training.

A frame independent formulation of analytical mechanics in the Newtonian space-time is presented. The differential geometry of affine values i.e., the differential geometry in which affine bundles replace vector bundles and sections of one dimensional affine bundles replace functions on manifolds, is used. Lagrangian a…

2004-04-29abs ↗pdf ↗

Main ideas of the differential geometry on affine bundles are presented. Affine counterparts of Lie algebroid and Poisson structures are introduced and discussed. The developed concepts are applied in a frame-independent formulation of the time-dependent and the Newtonian mechanics.

2005-10-04abs ↗pdf ↗

New framework learns disentangled causal representations from observed labels.

problem Learning meaningful disentangled causal representations from observed data.
method ICM-VAE framework using flow-based diffeomorphic functions and causal disentanglement prior.
result Induces highly disentangled causal factors and improves robustness.

New framework improves model robustness by focusing on stable relations across environments.

problem Standard supervised learning fails under data distribution shift.
method Gradient-based learning framework derived from the principle of independent causal mechanisms (ICM).
result Models generalize well to unseen scenarios, ignoring unstable relations.

IMA addresses non-identifiability in nonlinear ICA by assuming orthogonal Jacobian columns.

problem Non-identifiability in nonlinear ICA.
method IMA assumes orthogonal Jacobian columns and extends to manifold settings.
result IMA circumvents non-identifiability issues and can be beneficial for higher-dimensional observations.

Statistical learning relies upon data sampled from a distribution, and we usually do not care what actually generated it in the first place. From the point of view of causal modeling, the structure of each distribution is induced by physical mechanisms that give rise to dependences between observables. Mechanisms, howe…

2017-12-04abs ↗pdf ↗

The postulate of independence of cause and mechanism (ICM) has recently led to several new causal discovery algorithms. The interpretation of independence and the way it is utilized, however, varies across these methods. Our aim in this paper is to propose a group theoretic framework for ICM to unify and generalize the…

2017-05-05abs ↗pdf ↗

In the present paper we discuss an independent on the Grothendieck-Sato isomorphism approach to the Riemann-Roch-Hirzebruch formula for an arbitrary differential operator. Instead of the Grothendieck-Sato isomorphism, we use the Topological Quantum Mechanics (more or less equivalent to the well-known constructions with…

2004-01-28abs ↗pdf ↗

A common assumption in causal modeling posits that the data is generated by a set of independent mechanisms, and algorithms should aim to recover this structure. Standard unsupervised learning, however, is often concerned with training a single model to capture the overall distribution or aspects thereof. Inspired by c…

2018-04-30abs ↗pdf ↗

Detect hidden confounding in observational data using multiple environments.

problem Detect hidden confounding in observational data.
method Theoretical framework and simulation studies to test for hidden confounding.
result The proposed procedure correctly predicts hidden confounding, especially when bias is large.

TCRI improves domain generalization by enforcing conditional independence constraints.

problem Limitations of existing domain generalization methods due to incomplete constraints.
method TCRI implements regularizers motivated by conditional independence constraints.
result TCRI achieves cross-domain stability and outperforms baselines in worst-domain accuracy.

A framework for disentangling class-related and class-independent factors in data.

problem Learning disentangled representations in variational autoencoders.
method Attention mechanism in latent space, mixture models, Bhattacharyya coefficient, semi-supervised training.
result Disentangles class-related and class-independent factors of variation.

New mechanism for pure differential privacy on functional summaries using Laplace-like process.

problem Challenges in achieving differential privacy for complex, structured functional summaries.
method Independent Component Laplace Process (ICLP) mechanism for infinite-dimensional Hilbert space.
result Effective enhancement of utility of private summaries through oversmoothing.

We study mechanical systems subject to constraint functions that can be dependent at some points and independent at the rest. Such systems are modelled by means of generalized codistributions. We discuss how the constraint force can transmit an impulse to the motion at the points of dependence and derive an explicit fo…

2000-08-18abs ↗pdf ↗

Paper introduces a Gaussian Process for operator learning in computational mechanics.

problem Efficient and accurate solutions for large datasets with reliable uncertainty quantification.
method Gaussian Process (GP) embedded in a neural operator framework with stochastic dual descent (SDD) algorithm.
result Improves GP resolution independence and scalability for high-dimensional and non-linear systems.

A general, consistent and complete framework for geometrical formulation of mechanical systems is proposed, based on certain structures on affine bundles (affgebroids) that generalize Lie algebras and Lie algebroids. This scheme covers and unifies various geometrical approaches to mechanics in the Lagrangian and Hamilt…

2006-04-06abs ↗pdf ↗

Exact 1-Wasserstein distance between location-scale distributions derived, with privacy effects studied.

problem Calculating the 1-Wasserstein distance between location-scale distributions and its impact on differential privacy.
method Exact expressions and special functions for 1-Wasserstein distance, new upper bounds, and asymptotic analysis.
result New linear upper bound and detailed asymptotic bounds for Gaussian case, effect of differential privacy studied.

Based on ideas of W. M. Tulczyjew, a geometric framework for a frame-independent formulation of different problems in analytical mechanics is developed. In this approach affine bundles replace vector bundles of the standard description and functions are replaced by sections of certain affine line bundles called AV-bund…

2004-02-26abs ↗pdf ↗

New approach identifies latent properties from mechanisms, not just data.

problem Identifying latent properties from data generating processes.
method Equivariance perspective on identifiable representation learning.
result Identification of latent properties is possible up to shared equivariances in known mechanisms.

VAEs improve representation learning by inverting the data-generating process through self-consistency.

problem VAEs struggle to invert the data-generating process, yet often succeed in representation learning.
method Studied VAEs in the limit of near-deterministic decoders, proving self-consistency and showing ELBO convergence to a regularized log-likelihood.
result VAEs can perform independent mechanism analysis (IMA), recovering true latent factors under specific conditions.

New privacy mechanism for user-level discrete distributions with reduced penalty.

problem Achieving privacy for all items of a single user in practical applications.
method Study of learning discrete distributions with user-level differential privacy, proposing a new mechanism with reduced privacy penalty.
result Proposed mechanism reduces privacy penalty to ildeO(k/(mα2)+k/mεα) ilde{\mathcal{O}}(k/(mα^2) + k/\sqrt{m}εα), significantly smaller than standard mechanisms.

We propose a method to classify the causal relationship between two discrete variables given only the joint distribution of the variables, acknowledging that the method is subject to an inherent baseline error. We assume that the causal system is acyclicity, but we do allow for hidden common causes. Our algorithm presu…

2016-11-04abs ↗pdf ↗

Researchers develop methods for causal inference with imperfect instrumental variables.

problem Quantifying cause and effect relationships with imperfect instrumental variables.
method Established a quantitative relationship between violations of instrumental inequalities and minimal measurement dependence, providing adapted inequalities valid in the presence of relaxed measurement dependence.
result Adapted inequalities for average causal effect in instrumental scenarios with binary outcomes, addressing violations of instrumental inequalities.

New insights into how encoder-decoder networks generate attention matrices.

problem Understanding how encoder-decoder networks use attention matrices.
method Decomposing hidden states into temporal and input-driven components.
result Attention matrices are formed based on task requirements, not architecture type.

Unified framework for representation and causal structure learning using exchangeable data.

problem Identifying latent representations or causal structures in non-i.i.d. data.
method Identifiable Exchangeable Mechanisms (IEM) framework for representation and structure learning.
result New insights and identifiability results for causal structure and representation learning.

Writing the article-Time independent pricing of options in range bound markets; the question in the title came naturally to my mind. It is stated, in the above article, that in certain market conditions the stock price is subjected to an equation that exactly matches a time independent Schrodinger equation. The time in…

2013-05-07abs ↗pdf ↗

New methods for identifying and estimating missing data under complex mechanisms.

problem Missing data mechanisms dependent on missing values themselves.
method Developed a new MNAR model and proposed semiparametric estimation methods.
result Established sufficient conditions for identifying complete-data distribution and missingness mechanism.

New bounds for KANs trained with DP-SGD, addressing correlated noise.

problem Risk bounds for Kolmogorov-Arnold Networks trained by DP-SGD with correlated noise.
method Established new optimization and population risk analysis for KANs trained with DP-SGD, addressing correlated noise.
result First optimization and population risk analysis of correlated-noise mechanisms for DP training in non-convex settings, including neural networks.

Information Geometric Causal Inference (IGCI) is a new approach to distinguish between cause and effect for two variables. It is based on an independence assumption between input distribution and causal mechanism that can be phrased in terms of orthogonality in information space. We describe two intuitive reinterpretat…

2014-02-11abs ↗pdf ↗

This paper tackles time series imputation by identifying and modeling different missing mechanisms.

problem Different types of missing mechanisms (MAR, MNAR) in time series data.
method Proposes a framework for time series imputation by analyzing data generation processes and modeling latent variables via variational inference and normalizing flow.
result Establishes identifiability results for latent variables under nonlinear independent component analysis, showing that latent variables are identifiable.

The usual formulations of time-dependent mechanics start from a given splitting Y=R×MY=R\times M of the coordinate bundle YRY\to R. From physical viewpoint, this splitting means that a reference frame has been chosen. Obviously, such a splitting is broken under reference frame transformations and time-dependent canonical …

1997-02-25abs ↗pdf ↗

A new model shows fairness mechanisms can improve selection utility even without implicit bias.

problem Improving selection fairness without introducing a utility trade-off.
method A model with latent quality and group-dependent variance, comparing fairness mechanisms to group-oblivious selection.
result Demographic parity always increases selection utility, while γγ-rules weakly increase it.