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

77154230307 · May 202619922001200920172026
48 results for Identification theory

Simplified identification methods for causal inference with arbitrary interventional distributions.

problem Estimating cause-effect relationships from data with experimental interventions.
method Using Single World Intervention Graphs and nested model factorization, we provide algorithms for identifying causal parameters from mixed observational and interventional distributions.
result Our algorithms are complete for certain types of interventional marginal distributions.

This paper develops a Hamiltonian reduction method for field theories over affine principal bundles.

problem Developing a Hamiltonian reduction theory for field theories over affine principal bundles.
method Introducing a canonical identification to describe the reduced multisymplectic space without a connection.
result Derivation of reduced Hamilton-Cartan equations and a reduced covariant bracket.

Study on identifying and inferring nonlinear dynamics on unknown networks.

problem Identifying network structure in nonlinear dynamic systems with unknown interactions.
method Showed network structure is not generically identified, requiring sufficient spectral heterogeneity. Developed necessary and sufficient conditions for identification and proposed a semiparametric estimator.
result Necessary and sufficient conditions for identification of network structure in nonlinear dynamic systems.

Method identifies IPS governing equations from particle data efficiently.

problem Identify governing equations of interacting particle systems efficiently.
method Combines mean-field theory and WSINDy for large NN and MM.
result Converges with rate O(N1/2)\mathcal{O}(N^{-1/2}) for N100N \geq 100.

End-to-end algorithm for controlling bilinear systems with probabilistic noise.

problem Controlling bilinear systems with noisy data.
method Proposes an end-to-end algorithm using statistical learning theory and robust controller design.
result Derived finite sample identification error bounds and structurally suitable for control.

The paper explores when linear system identification is hard or easy, especially for under-actuated systems.

problem Statistical hardness of learning linear systems, especially under-actuated or under-excited systems.
method Using tools from minimax theory and recent statistical tools for finite sample analysis of system identification.
result The controllability index of linear systems affects the sample complexity of identification, making some systems hard to learn.

We provide a brief tutorial on the use of concentration inequalities as they apply to system identification of state-space parameters of linear time invariant systems, with a focus on the fully observed setting. We draw upon tools from the theories of large-deviations and self-normalized martingales, and provide both d…

2019-06-27abs ↗pdf ↗

We establish a foundation for multivariate counterfactual identification using dynamic optimal transport.

problem Addressing the open question of counterfactual identification for high-dimensional multivariate outcomes from observational data.
method Establish a foundation for multivariate counterfactual identification using continuous-time flows, including non-Markovian settings, with tools from dynamic optimal transport.
result Characterise the conditions under which flow matching yields a unique, monotone, and rank-preserving counterfactual transport map, ensuring consistent inference.

Paper reduces sample complexity for bilinear systems identification to nearly constant.

problem Identifying discrete-time bilinear systems under bounded disturbances.
method Uses trajectory-dependent regressors and polynomial mean-square state growth analysis.
result Proves sample complexity of O~(1/ε)\widetilde{\mathcal O}(1/ε) for estimation error εε.

New framework recovers reward and rationality parameters from game behavior.

problem Statistical ambiguity in identifying reward and rationality parameters in competitive games.
method Blind Inverse Game Theory (Blind-IGT) using entropy-regularized Quantal Response Equilibrium and Normalized Least Squares (NLS) estimator.
result Optimal convergence rate of O(N1/2)\mathcal{O}(N^{-1/2}) for joint parameter recovery.

The paper tackles individualized decision-making under unmeasured confounding, providing a novel minimax solution and a paradox.

problem Unmeasured confounding in causal inference leads to biased estimates and affects individualized decision-making.
method The authors establish a formal link between individualized decision-making under partial identification and classical decision theory, providing a minimax solution and a paradox.
result A novel minimax solution for individualized decision-making/policy assignment is provided, and an interesting paradox is drawn.

Survey on statistical learning theory for control, focusing on linear systems.

problem Applying machine learning techniques to control systems, especially linear ones.
method Adapting tools from modern high-dimensional statistics and learning theory.
result Recent advances in statistical learning theory for control, particularly for linear systems.

Study supports recovery of PDEs from noisy data using a specific regularization method.

problem Support recovery of PDEs from a single noisy trajectory.
method Applying ℓ1-regularized Pseudo-Least Squares model to a given data set.
result Support of ℓ1-c coefficients asymptotically converges to the true signed-support of the PDE.

The paper explores how missing data problems are related to causal inference.

problem Missing data in experiments makes causal inference difficult.
method The paper reinterprets missing data as a form of causal inference by considering counterfactual variables.
result Identification assumptions in missing data can be encoded using graphical models of counterfactual and observed variables.

New method improves neural network robustness by identifying functions rather than parameters.

problem Neural networks' lack of robustness to distribution shifts.
method Identify the function represented by quadratic networks, not their parameters.
result Obtain robust generalization bounds for neural networks.

Unified model optimizes experiment performance and reduces duration.

problem Balancing reward maximization and experiment termination.
method Unified model that considers both within-experiment and post-experiment outcomes.
result Familiar algorithms can optimize a broad class of objectives with proper parameter adjustment.

The paper sets sample complexity bounds for identifying LTI systems from a finite set.

problem Identifying an LTI system from a finite set of possible systems using trajectory data.
method Maximum likelihood estimator and information theory tools.
result Upper and lower bounds for sample complexity are derived, independent of stability assumption.

New bounds for causal effect identification in time series graphs with latent confounders.

problem Identifying causal effects in time series graphs with latent confounders over unbounded time intervals.
method Applying the Causal Identification algorithm to a constant-size segment of the time series graph.
result A bound on the number of past time steps needed for causal effect identification.

Synthetic theory defines orbifolds as microlinear types with finite identifications.

problem Defining orbifolds in traditional set-level foundations with internal symmetries.
method Synthetic differential cohesive homotopy type theory, microlinearity, finite identifications.
result Proper étale groupoids are orbifolds in synthetic theory.

Modern data analysis depends increasingly on estimating models via flexible high-dimensional or nonparametric machine learning methods, where the identification of structural parameters is often challenging and untestable. In linear settings, this identification hinges on the completeness condition, which requires the …

2017-09-11abs ↗pdf ↗

Paper tackles best mixed arm identification with cost constraints in bandit models.

problem Finding the best mixed arm with cost constraints in a stochastic bandit model.
method Proposes SFSR algorithm combining successive reject and score-function-based rejection criteria.
result Upper and lower bounds on mis-identification probability show exponential decay with budget.

New algorithm identifies causal relationships from graphs, even with selection bias.

problem Identifying causal relationships from graphs with selection bias.
method Developed a measure-theoretic version of Pearl's causal calculus and a sound, complete identification algorithm.
result General measure-theoretic version of causal calculus allows for identification of causal relationships under selection bias.

We explain how deformation theories of geometric objects such as complex structures, Poisson structures and holomorphic bundle structures lead to differential Gerstenhaber or Poisson algebras. We use homological perturbation theory to obtain AA_{\infty} algebra structures and some canonically defined deformations of s…

1999-06-14abs ↗pdf ↗

The paper develops a theory for identifying the best arm in non-parametric multi-armed bandits with a fixed budget.

problem Identifying the best arm in non-parametric multi-armed bandits with a limited number of trials.
method The paper proposes upper and lower bounds on the average log-probability of misidentification using information-theoretic quantities and a refined analysis of the successive-rejects strategy.
result The paper provides new upper and lower bounds on the average log-probability of misidentification, which generalize existing bounds.

We demonstrate the agreement between the Higgs branches of two N=2 theories proposed by Argyres and Seiberg to be S-dual, namely the SU(3) gauge theory with six quarks, and the SU(2) gauge theory with one pair of quarks coupled to the superconformal theory with E_6 flavor symmetry. In mathematical terms, we demonstrate…

2008-10-25abs ↗pdf ↗

In this paper, we analyze the finite sample complexity of stochastic system identification using modern tools from machine learning and statistics. An unknown discrete-time linear system evolves over time under Gaussian noise without external inputs. The objective is to recover the system parameters as well as the Kalm…

2019-03-21abs ↗pdf ↗

Paper develops a novel approach to identify clusters of features in multivariate extremes.

problem Understanding the complex structure of multivariate extremes in various fields.
method Optimization-based approach to assess the dependence structure of extremes.
result Estimating clusters of features that best capture the support of extremes.

PROBE optimizes best-arm identification with cheap proxies, improving sample complexity.

problem Fixed-confidence best-arm identification with costly rewards and correlated cheap proxies.
method PROBE uses control-variate adjustment and phase elimination to learn residual variance online.
result PROBE achieves oracle sample complexity up to a constant factor and additive calibration cost.

New algorithms improve best-arm identification with varying rewards.

problem Identifying the best arm with varying reward variances in fixed budget.
method Proposed two algorithms: SHVar for known variances, SHAdaVar for unknown variances; uses non-uniform budget allocation.
result Bounding misidentification probabilities for both algorithms.

We identify linear models from nonlinear systems with initialization constraints.

problem Identifying linear models from nonlinear systems with initialization constraints.
method Multiple trajectories-based deterministic data acquisition algorithm followed by regularized least squares.
result We provide a finite sample error bound on the learned linearized dynamics.

Develops geometric causal models for causal inference from dependent data.

problem Causal inference from structured, dependent data (e.g., spatial, network, molecular).
method Geometric causal models (GCMs) exploiting symmetries of data generating process, combining group theory, ergodic theory, and Bayesian inference.
result Establishes identification and estimation of causal effects from dependent data.

We focus on spectral clustering of unlabeled graphs and review some results on clustering methods which achieve weak or strong consistent identification in data generated by such models. We also present a new algorithm which appears to perform optimally both theoretically using asymptotic theory and empirically.

2015-08-07abs ↗pdf ↗

Develops methods to identify and estimate causal effects with instrumental variables.

problem Causal inference with confounded treatment assignment and unobserved variables.
method General nonparametric causal framework, debiased machine learning, semiparametric theory.
result Consistent and asymptotically normal estimators for average treatment effect.

New method identifies distribution grid outages using smart meter data.

problem Outages in urban distribution grids due to DERs and smart meters' last gasp signals.
method Data-driven approach based on stochastic time series analysis and maximum likelihood estimation.
result Proves optimal performance in identifying distribution grid outages using smart meter data.

Study language generation with limited memory, showing different impacts on achievable densities and convergence.

problem Language generation with bounded memory constraints.
method Analyzed memoryless generators, sliding windows, and adaptive past examples; revisited identification in the limit.
result Achievable densities and convergence properties differ based on the size of the target language collection.

We provide several constructions in differential KO-theory. First, we construct a differential refinement of the A^\hat{A}-genus and a pushforward leading to a Riemann-Roch theorem. We set up a differential refinement of the Atiyah-Hirzebruch spectral sequence (AHSS) for differential KO-theory and explicitly identify t…

2018-09-19abs ↗pdf ↗

Paper explores using EEG for better speaker identification, even in noisy environments.

problem Speaker identification performance degrades in background noise.
method Uses EEG signals to enhance speaker identification systems, comparing with acoustic features.
result Speaker identification system using only EEG features outperforms one using only acoustic features in high background noise.

In this paper we introduce a notion of scattering theory for the Laplace-Beltrami operator on non-compact, connected and complete Riemannian manifolds. A principal condition is given by a certain positive lower bound of the second fundamental form of angular submanifolds at infinity. Another condition is certain bounds…

2011-09-09abs ↗pdf ↗

In this paper, we consider solutions and spectral functions of M-theory from Milne spaces with extra free dimensions. Conformal deformations to the metric associated with the real hyperbolic space forms are derived. For the three-dimensional case, the orbifold identifications SL(2,Z+iZ)/{±Id}SL(2,{\mathbb Z}+i{\mathbb Z})/\{\pm Id\}

2005-01-03abs ↗pdf ↗

We learn linear models from nonlinear systems using multiple trajectories and regularization.

problem Identifying linear models from data when the underlying dynamics are nonlinear.
method Multiple trajectories data acquisition followed by regularized least squares.
result Learn linearized dynamics with arbitrarily small error given enough samples.

Paper defines saddle points in asymmetric Dynkin games using martingale theory.

problem Tackles saddle point conditions in asymmetric Dynkin games with partial information.
method Uses martingale theory to identify super and submartingales related to equilibrium payoffs.
result Characterizes saddle point strategies in terms of equilibrium payoffs' dynamics and Doob-Meyer decompositions.