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

25.0%50.0%75.0%100.0% · Feb 199419922001200920172026
48 results for Model Identification

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.

Proposes SPCA to incorporate structural constraints in model identification.

problem Model identification with partial structural knowledge.
method Structural Principal Component Analysis (SPCA) that leverages structural information.
result Demonstrates improved model estimates using synthetic and industrial data.

Equation discovery methods enable modelers to combine domain-specific knowledge and system identification to construct models most suitable for a selected modeling task. The method described and evaluated in this paper can be used as a nonlinear system identification method for gray-box modeling. It consists of two int…

2019-07-01abs ↗pdf ↗

ADSGD method speeds up model identification in sparse optimization.

problem Implicit model identification in sparse optimization problems.
method Accelerated Doubly Stochastic Gradient Method (ADSGD) for faster explicit model identification.
result ADSGD achieves faster explicit model identification and improved algorithm efficiency.

Consistent partial identification of causal effects proved for neural models.

problem Consistency of neural causal partial identification methods.
method Proving consistency for neural models with continuous and categorical variables, considering architecture design and Lipschitz regularization.
result Proven consistency of partial identification via neural causal models in a general setting.

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.

Bayesian methods reduce variance in subspace identification for small data sets.

problem High variance in traditional subspace identification methods for large models or small sample sizes.
method Investigation of Bayesian estimation solutions (regularized and shrinkage estimators) for subspace identification.
result Bayesian estimators reduce estimation risk by up to 40% compared to traditional methods.

Paper introduces a conformer-based system for streaming language identification in long-form speech.

problem Language identification in long-form audio.
method Conformer layers with attentive temporal pooling and domain adaptation.
result Conformer-based models significantly outperform LSTM and transformer models.

Modeling dynamical systems is important in many disciplines, e.g., control, robotics, or neurotechnology. Commonly the state of these systems is not directly observed, but only available through noisy and potentially high-dimensional observations. In these cases, system identification, i.e., finding the measurement map…

2014-10-28abs ↗pdf ↗

Bayesian neural networks with nonparametric noise models for system identification.

problem Estimating parameters and noise processes in stochastic dynamic systems.
method Bayesian nonparametric approach using neural networks and Gibbs sampler.
result The method converges to full nonparametric Bayesian regression model.

dynoGP uses deep Gaussian processes for dynamic system identification.

problem System identification for complex dynamical systems.
method Interconnecting linear dynamic GPs and static GPs to model dynamic and static nonlinearities.
result Demonstrates effectiveness of the approach using both simulated and real-world data.

This paper tackles Bayesian system identification with probabilistic numerical methods.

problem Accurately modeling nonlinear dynamic systems from noisy data.
method Probabilistic Sequential Monte Carlo (SMC) combined with probabilistic numerical integration.
result Efficient identification of latent states and system parameters from noisy measurements.

Recent developments within deep learning are relevant for nonlinear system identification problems. In this paper, we establish connections between the deep learning and the system identification communities. It has recently been shown that convolutional architectures are at least as capable as recurrent architectures …

2019-09-04abs ↗pdf ↗

This research improves deep neural networks for parameter identification and prediction in stochastic Volterra integral equations.

problem Parameter identification and prediction in Volterra integral equations driven by Gaussian noise.
method Improved deep neural networks framework that incorporates inter-output relationships into the loss function.
result The framework enhances parameter estimation accuracy and provides accurate solutions for modeling stochastic systems.

This paper addresses the identification of insurance models with multidimensional screening where insurees have private information about their risk and risk aversion. The model includes a random damage and the possibility of several claims. Screening of insurees relies on their certainty equivalence. The paper then in…

2015-08-12abs ↗pdf ↗

Bayesian method improves online NARMAX model identification.

problem Online identification of nonlinear systems with small sample sizes and low noise.
method Variational Bayesian inference using message passing algorithm for polynomial NARMAX models.
result Variational Bayesian estimator outperforms recursive and offline least-squares methods.

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.

A method for identifying NPWARX models with arbitrary domains using probabilistic mixture models.

problem Identifying hybrid system models with discontinuous maps.
method Probabilistic mixture model with a neural network for nonlinear partitioning and Expectation Maximization for parameter estimation.
result Demonstrated on a nonlinear piece-wise problem with discontinuous maps.

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.

Efficiently identifies best policies in tabular MDPs with reduced computational cost.

problem Identifying the best policy in tabular MDPs with high computational cost.
method Combines posterior sampling with online learning to achieve asymptotic optimality.
result Achieves optimal sample complexity and posterior contraction rate with O(S2AH)O(S^2AH) per episode.

Paper proposes a new PLL framework with a progressive identification algorithm.

problem Weakly supervised learning with partial labels.
method Flexible model and optimization algorithm for PLL, progressive identification algorithm.
result Established an estimation error bound and set new state of the art.

Meta-learners estimate CATE from multiple environments with partial identification.

problem Estimating CATE from observational data across multiple environments with violations of causal assumptions.
method Adapt IV literature for partial identification, propose model-agnostic meta-learners.
result Meta-learners effectively estimate CATE bounds across various experiments.

Paper addresses online identification and clustering for mixed linear regression models.

problem Online identification and clustering of mixed linear regression models.
method Introduces two online identification algorithms based on the EM principle, proving global convergence without i.i.d. data assumptions.
result Global convergence of the proposed algorithms for mixed linear regression models.

Objective: Patient notes in electronic health records (EHRs) may contain critical information for medical investigations. However, the vast majority of medical investigators can only access de-identified notes, in order to protect the confidentiality of patients. In the United States, the Health Insurance Portability a…

2016-06-10abs ↗pdf ↗

New method identifies diffusion sources on networks with statistical confidence.

problem Identifying sources of diffusion on networks without restrictive assumptions.
method Statistical framework and confidence set inference approach based on hypothesis testing.
result Efficiently produces a small subset of nodes covering the source node with any confidence level.

An adversarial process between two deep neural networks is a promising approach to train a robust model. In this paper, we propose an adversarial process using cosine similarity, whereas conventional adversarial processes are based on inverted categorical cross entropy (CCE). When used for training an identification mo…

2019-07-01abs ↗pdf ↗

IIC decouples causal identification into two phases, significantly reducing the HTC gap in linear SEMs.

problem Determining causal effect coefficients in linear SEMs with latent confounders using the Half-Trek Criterion (HTC) leaves a gap of inconclusive causal effects.
method Iterative Identification Closure (IIC) framework that decouples causal identification into two phases: a seed function S_0 and Reduced HTC propagation.
result IIC strictly subsumes both HTC and ancestor decomposition, reducing the HTC gap by over 80% with combined seeds.

BINDy uses Bayesian methods to identify nonlinear dynamics from data.

problem Learning sparse representations of complex dynamics from data.
method Bayesian treatment of dictionary learning system identification using reversible-jump Markov-chain Monte-Carlo.
result BINDy produces models that are sparse in model space rather than parameter space.

Study on generating and identifying languages privately, showing privacy imposes costs and creates barriers.

problem Generating and identifying languages privately in the limit model.
method Introduced a continual release model under differential privacy constraints, proving both positive and negative results.
result Privacy imposes quantitative and qualitative costs, and creates fundamental barriers for identification.

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.

PhICNet combines physics and deep learning for forecasting and source identification in dynamical systems.

problem Forecasting and identifying unobservable external sources in spatio-temporal dynamical systems.
method Physics-Incorporated Convolutional Recurrent Neural Network (PhICNet).
result PhICNet can forecast dynamics and identify sources for relatively long periods.

Study identifies and validates a method for system identification of Markov jump linear systems.

problem System identification for autonomous Markov jump linear systems with complete state observations.
method Proposes switched least squares method for identification and derives rates of convergence.
result Data-independent rate of convergence is O(log(T)/T)\mathcal{O}\big(\sqrt{\log(T)/T} \big), showing strong consistency.