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

Trend · papers per month

4318621,2931,724 · Jun 202019922001200920172026
48 results for data generating mechanism

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 ↗

Study investigates OOD generalization methods for mechanics problems.

problem Real-world mechanics problems with unknown test environments and data distribution shifts.
method Investigates OOD generalization methods for regression problems in mechanics.
result OOD generalization methods perform better than traditional ML methods on mechanics-specific regression problems.

Many modern databases include personal and sensitive correlated data, such as private information on users connected together in a social network, and measurements of physical activity of single subjects across time. However, differential privacy, the current gold standard in data privacy, does not adequately address p…

2016-03-13abs ↗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.

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.

We consider the problem of obfuscating sensitive information while preserving utility, and we propose a machine learning approach inspired by the generative adversarial networks paradigm. The idea is to set up two nets: the generator, that tries to produce an optimal obfuscation mechanism to protect the data, and the c…

2019-04-01abs ↗pdf ↗

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.

We present a general framework, the coupled compound Poisson factorization (CCPF), to capture the missing-data mechanism in extremely sparse data sets by coupling a hierarchical Poisson factorization with an arbitrary data-generating model. We derive a stochastic variational inference algorithm for the resulting model …

2017-01-09abs ↗pdf ↗

Paper develops novel privacy mechanism for Riemannian manifold data using geometric analysis and heat diffusion.

problem Privacy-preserving estimation of generalized Frechet mean on Riemannian manifolds.
method Characterizes Renyi divergence via Harnack inequalities, introduces mechanisms based on heat diffusion and Langevin process.
result Proposes mechanisms for nonnegative and general Riemannian manifolds with detailed utility analyses.

Paper proposes a new hierarchical attention mechanism for multi-scale data.

problem Challenges in applying neural attention to multi-scale, multi-modal data.
method Developed a mathematical framework for multi-modal, multi-scale data and derived optimal neural attention mechanics.
result Proposed hierarchical attention mechanism improves transformer performance in multi-scale, multi-modal settings.

Expands differential privacy mechanisms to include the Generalized Gaussian mechanism for improved private machine learning.

problem Improving privacy in machine learning algorithms while maintaining utility.
method Introduces and analyzes the Generalized Gaussian (GG) mechanism for differential privacy.
result The GG mechanism provides better performance than the Laplace and Gaussian mechanisms across various values of β.

FinML-Chain integrates blockchain data for financial machine learning.

problem Challenges in financial machine learning, including missing data, lack of transparency, and incompatible data sources.
method Blockchain technology integrated with machine learning techniques to address financial market challenges.
result Framework generates datasets for analyzing economic mechanisms, advancing financial research.

We present a data-driven framework called generative adversarial privacy (GAP). Inspired by recent advancements in generative adversarial networks (GANs), GAP allows the data holder to learn the privatization mechanism directly from the data. Under GAP, finding the optimal privacy mechanism is formulated as a constrain…

2018-07-13abs ↗pdf ↗

Paper explores Bayes rule for Gaussian mixtures with missing data, outperforming supervised classifiers.

problem Improving classification accuracy in partially classified samples with missing data.
method Generative model framework with missing-data mechanism, Bayes rule allocation.
result Bayes rule classifier with missing-data mechanism outperforms fully supervised classifiers in various conditions.

Method recovers causal diffusion mechanisms from steady-state data without parametric assumptions.

problem Recovering causal diffusion mechanisms from steady-state gene expression data.
method Non-parametric kernel estimator for drift function, cross-validation for hyperparameter tuning.
result Full causal mechanism can be non-parametrically identified under weak non-explosion criterion.

Proposes a new method for estimating counterfactual treatment effects.

problem Uncertainty in identifying causal mechanisms from observational data.
method Introduces a parameterized family of causal mechanisms that generalize Gumbel-max, trained to minimize counterfactual effect variance.
result Trained mechanisms yield lower variance estimates of counterfactual treatment effects.

Generative adversarial nets (GAN) has been successfully introduced for generating text to alleviate the exposure bias. However, discriminators in these models only evaluate the entire sequence, which causes feedback sparsity and mode collapse. To tackle these problems, we propose a novel mechanism. It first segments th…

2019-05-30abs ↗pdf ↗

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 ↗

TS-K-means improves financial data clustering with dynamic time warping.

problem Inadequate handling of temporal dependencies in financial time series data.
method Integrates Dynamic Time Warping into Time Series K-means for financial data.
result TS-K-means outperforms traditional K-means in financial data analysis.

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 ↗

CICME estimates common and domain-specific causal mechanisms from multi-sensor data.

problem Inferring causal mechanisms from heterogeneous multi-sensor data across multiple domains.
method Three-step approach using Causal Transfer Learning (CTL).
result CICME reliably detects domain-invariant causal mechanisms and guides individual domain causal mechanism estimation.

In this paper we study dynamic pricing mechanism of contingent claims. A typical model of such pricing mechanism is the so-called g-expectation Es,tg[X]E^g_{s,t}[X] defined by the solution of the backward stochastic differential equation with generator g and with the contingent claim X as terminal condition. The generating f…

2012-11-28abs ↗pdf ↗

In recent years, data has played an increasingly important role in the economy as a good in its own right. In many settings, data aggregators cannot directly verify the quality of the data they purchase, nor the effort exerted by data sources when creating the data. Recent work has explored mechanisms to ensure that th…

2019-04-29abs ↗pdf ↗

We propose an optimum mechanism for providing monetary incentives to the data sources of a statistical estimator such as linear regression, so that high quality data is provided at low cost, in the sense that the sum of payments and estimation error is minimized. The mechanism applies to a broad range of estimators, in…

2014-08-11abs ↗pdf ↗

We study the problem of what causes prices to change. We define the mechanical impact of a trading order as the change in future prices in the absence of any future changes in decision making, and its it informational impact as the remainder of the total impact once mechanical impact is removed. We introduce a method o…

2006-08-27abs ↗pdf ↗

Investigates the benefits of multi-head attention in Transformers, deriving convergence and generalization guarantees.

problem Underexplored dynamics of multi-head attention in Transformer training and generalization.
method Derives convergence and generalization guarantees for gradient-descent training of a multi-head self-attention model.
result Establishes conditions for initialization that ensure multi-head attention's realizability.

A new mechanism for differentially private Fréchet mean on SPD matrices.

problem Privacy-preserving statistical summaries for SPD matrices.
method Tangent Gaussian mechanism for log-Euclidean metric.
result Significantly better utility and computational efficiency.

We propose a method to model multi-agent behaviors with limited observation and mechanical constraints.

problem Modeling real-world multi-agent behaviors with limited observation and mechanical constraints.
method Decentralized generative models with partial observation and mechanical constraints based on hierarchical variational recurrent neural networks.
result Our method effectively models and predicts biologically plausible behaviors with minimal constraint violations.

Ranked data appear in many different applications, including voting and consumer surveys. There often exhibits a situation in which data are partially ranked. Partially ranked data is thought of as missing data. This paper addresses parameter estimation for partially ranked data under a (possibly) non-ignorable missing…

2019-02-28abs ↗pdf ↗

Enhances privacy in machine learning through Rényi Pufferfish mechanisms.

problem Designing general and efficient Pufferfish mechanisms that maintain privacy and utility.
method Introduces a Rényi divergence-based variant of Pufferfish, generalizes the Wasserstein mechanism, and proves privacy amplification results.
result Extends the applicability of Pufferfish framework and provides stronger privacy guarantees.

Generative Intervention Models predict perturbation effects without knowing the underlying mechanisms.

problem Predicting perturbation effects when the mechanisms are unknown.
method Generative Intervention Models (GIM) that map perturbation features to distributions over atomic interventions in a causal model.
result GIMs achieve robust out-of-distribution predictions and infer underlying perturbation mechanisms.

SGNs use Hamiltonian mechanics for invertible deep generative modeling.

problem Efficient and exact likelihood evaluation for deep generative models.
method Symplectic structure in latent space, Hamiltonian dynamics for data generation.
result Exact likelihood evaluation without Jacobian calculations.

A solution for the Weinstein's Problem in the general framework of generalized Lie algebroids is the target of this paper. We present the mechanical systems called by use, mechanical (?; ?)-systems, Lagrange mechanical (?; ?)-systems or Finsler mechanical (?; ?)-systems and we develop their geometries. We obtain the ca…

2011-08-14abs ↗pdf ↗

Optimal LDP mechanisms reduce data unfairness in classification.

problem Reducing data unfairness in classification models.
method Developed a closed-form optimal mechanism for binary attributes and a tractable framework for multi-valued attributes.
result Optimal LDP mechanisms improve fairness in classification while maintaining accuracy close to non-private models.