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

3517021,0521,403 · Jun 202019922001200920172026
48 results for Parsimonious models

The parsimonious Gaussian mixture models, which exploit an eigenvalue decomposition of the group covariance matrices of the Gaussian mixture, have shown their success in particular in cluster analysis. Their estimation is in general performed by maximum likelihood estimation and has also been considered from a parametr…

2015-01-14abs ↗pdf ↗

Parsimonious neural networks discover interpretable physical laws from data.

problem Discovering interpretable physical laws from data using machine learning.
method Combining neural networks with evolutionary optimization to balance accuracy and parsimony.
result Developed models for classical mechanics and materials melting temperature prediction.

A parsimonious model reduces over-parameterization in skewed matrix variate mixtures.

problem Over-parameterization in skewed matrix variate mixtures.
method Parsimonious family of 256 models using bilinear factor analyzers constrained over clusters, with AECM algorithm for estimation.
result Extensive simulations and real-world datasets (MNIST, Olivetti faces) demonstrate the method's effectiveness.

A family of parsimonious shifted asymmetric Laplace mixture models is introduced. We extend the mixture of factor analyzers model to the shifted asymmetric Laplace distribution. Imposing constraints on the constitute parts of the resulting decomposed component scale matrices leads to a family of parsimonious models. An…

2013-11-01abs ↗pdf ↗

Finite mixtures of regression models offer a flexible framework for investigating heterogeneity in data with functional dependencies. These models can be conveniently used for unsupervised learning on data with clear regression relationships. We extend such models by imposing an eigen-decomposition on the multivariate …

2013-12-02abs ↗pdf ↗

New GMM models fit high-dimensional data with fewer parameters.

problem Overparameterization and lack of flexibility in GMMs for high-dimensional data.
method Piecewise-constant covariance eigenvalue profiles, EM and penalized EM algorithms.
result Superior likelihood-parsimony tradeoffs in density fitting, clustering, and denoising.

Bayesian context trees capture complex dependencies in categorical sequences.

problem Complex, long-range dependencies in categorical sequences are not well captured by simple models.
method Parsimonious Bayesian context trees with model-based agglomerative clustering for efficient inference.
result The proposed framework outperforms existing models on real-world data.

Proposes a non-convex optimization method for a parsimonious weighted naive Bayes classifier.

problem Improving naïve Bayes classifier performance with a large number of input variables.
method Sparse regularization of model log-likelihood for direct estimation of variable weights.
result Optimization-based weighted naïve Bayes classifiers achieve equivalent performance to averaging-based classifiers.

Optimal AFs minimize RFR test error and sensitivity.

problem Finding optimal AFs for RFR to minimize test error and sensitivity.
method Closed-form solution for AFs minimizing test error and sensitivity under different functional parsimony.
result Optimal AFs can be linear, saturated linear, or Hermite polynomial expressions.

For a long time interest-rate models were built on a single yield curve used both for discounting and forwarding. However, the crisis that has affected financial markets in the last years led market players to revise this assumption and accommodate basis-swap spreads, whose remarkable widening can no longer be neglecte…

2010-11-03abs ↗pdf ↗

Combining Bayesian nonparametrics and a forward model selection strategy, we construct parsimonious Bayesian deep networks (PBDNs) that infer capacity-regularized network architectures from the data and require neither cross-validation nor fine-tuning when training the model. One of the two essential components of a PB…

2018-05-22abs ↗pdf ↗

Parsimonious Dynamic Mode Decomposition selects sparse modes robustly.

problem Manual tuning of sparsity parameters in traditional DMD.
method Time-delay embedding and Orthogonal Matching Pursuit.
result Autonomously determines optimally sparse subset of modes.

We consider the problem of modeling multivariate time series with parsimonious dynamical models which can be represented as sparse dynamic Bayesian networks with few latent nodes. This structure translates into a sparse plus low rank model. In this paper, we propose a Gaussian regression approach to identify such a mod…

2015-03-25abs ↗pdf ↗

Recent years have demonstrated that using random feature maps can significantly decrease the training and testing times of kernel-based algorithms without significantly lowering their accuracy. Regrettably, because random features are target-agnostic, typically thousands of such features are necessary to achieve accept…

2015-04-07abs ↗pdf ↗

Stochastic partition models divide a multi-dimensional space into a number of rectangular regions, such that the data within each region exhibit certain types of homogeneity. Due to the nature of their partition strategy, existing partition models may create many unnecessary divisions in sparse regions when trying to d…

2019-03-10abs ↗pdf ↗

Kolmogorov-Arnold Networks offer improved interpretability and parsimony in science tasks.

problem Improving interpretability and parsimony in science-oriented tasks.
method Theoretical analysis of Kolmogorov-Arnold Networks (KAN) with generalization bounds and model complexity.
result Generalization bounds for KAN with various activation functions, scaling with the l1l_1 norm of coefficient matrices and Lipschitz constants.

We propose a parsimonious topic model for text corpora. In related models such as Latent Dirichlet Allocation (LDA), all words are modeled topic-specifically, even though many words occur with similar frequencies across different topics. Our modeling determines salient words for each topic, which have topic-specific pr…

2014-01-22abs ↗pdf ↗

Paper discovers structural dynamics equations from only acceleration data.

problem Discovering equations from only acceleration measurements in structural dynamics.
method Library-based approach with Approximate Bayesian Computation (ABC) prioritizing parsimonious models.
result Efficacy demonstrated in four structural dynamics examples, including linear and nonlinear systems.

Variable selection for high-dimensional linear models has received a lot of attention lately, mostly in the context of l1-regularization. Part of the attraction is the variable selection effect: parsimonious models are obtained, which are very suitable for interpretation. In terms of predictive power, however, these re…

2009-06-19abs ↗pdf ↗

Let GG be a nonabelian, simple group with a nontrivial conjugacy class CGC \subseteq G. Let KK be a diagram of an oriented knot in S3S^3, thought of as computational input. We show that for each such GG and CC, the problem of counting homomorphisms π1(S3K)Gπ_1(S^3\setminus K) \to G that send meridians of KK to CC is al…

2019-07-13abs ↗pdf ↗

In this paper we offer a method and algorithm, which make possible fully autonomous (unsupervised) detection of new classes, and learning following a very parsimonious training priming (few labeled data samples only). Moreover, new unknown classes may appear at a later stage and the proposed xClass method and algorithm…

2019-11-01abs ↗pdf ↗

The analysis of multidimensional data is becoming a more and more relevant topic in statistical and machine learning research. Given their complexity, such data objects are usually reshaped into matrices or vectors and then analysed. However, this methodology presents several drawbacks. First of all, it destroys the in…

2020-02-11abs ↗pdf ↗

A stochastic model for pure-jump diffusion (the compound renewal process) can be used as a zero-order approximation and as a phenomenological description of tick-by-tick price fluctuations. This leads to an exact and explicit general formula for the martingale price of a European call option. A complete derivation of t…

2012-02-20abs ↗pdf ↗

We investigate LIBOR-based derivatives using a parsimonious field theory interest rate model capable of instilling imperfect correlation between different maturities. Delta and Gamma hedge parameters are derived for LIBOR Caps against fluctuations in underlying forward rates. An empirical illustration of our methodolog…

2005-04-29abs ↗pdf ↗

Enhances KANs for accuracy and interpretability with multi-exit architecture.

problem Unclear optimal depth for KANs and difficulty in optimization and interpretation.
method Introduces multi-exit KANs with each layer having its own prediction branch.
result Multi-exit KANs outperform single-exit versions on various datasets.

Improved SINDy autoencoder for identifying noisy dynamical systems.

problem Robust identification of noisy dynamical systems from data.
method Incorporates noise-separating neural network structures into SINDy autoencoder architecture.
result Accurately recovers latent dynamics and estimates measurement noise from noisy observations.

In this paper we consider sparse and identifiable linear latent variable (factor) and linear Bayesian network models for parsimonious analysis of multivariate data. We propose a computationally efficient method for joint parameter and model inference, and model comparison. It consists of a fully Bayesian hierarchy for …

2010-04-29abs ↗pdf ↗

We introduce a methodology to construct parsimonious probabilistic models. This method makes use of Information Filtering Networks to produce a robust estimate of the global sparse inverse covariance from a simple sum of local inverse covariances computed on small sub-parts of the network. Being based on local and low-…

2016-02-23abs ↗pdf ↗