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…
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
48 results for “Functional Parsimony”
We consider the problem of non-parametric regression with a potentially large number of covariates. We propose a convex, penalized estimation framework that is particularly well-suited for high-dimensional sparse additive models. The proposed approach combines appealing features of finite basis representation and smoot…
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.
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.
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 norm of coefficient matrices and Lipschitz constants.
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 …
This paper proposes a parsimoniously time varying parameter vector autoregressive model (with exogenous variables, VARX) and studies the properties of the Lasso and adaptive Lasso as estimators of this model. The parameters of the model are assumed to follow parsimonious random walks, where parsimony stems from the ass…
Despite their attractiveness, popular perception is that techniques for nonparametric function approximation do not scale to streaming data due to an intractable growth in the amount of storage they require. To solve this problem in a memory-affordable way, we propose an online technique based on functional stochastic …
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.
Researchers develop multi-utility representations for incomplete preferences linked to risk measures.
problem Handling incomplete preferences induced by set-valued risk measures.
method Established dual representations of set-valued risk measures to create parsimonious and well-behaved multi-utility representations.
result Unified dual representations of set-valued risk measures, linking them to scalar risk measures.
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…
Forest Garrotestat.ML
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…
A family of parsimonious Gaussian cluster-weighted models is presented. This family concerns a multivariate extension to cluster-weighted modelling that can account for correlations between multivariate responses. Parsimony is attained by constraining parts of an eigen-decomposition imposed on the component covariance …
New method groups similar functional covariates for better modeling.
problem Analyzing functional covariates with similar shapes.
method Coefficient shape alignment regularization approach.
result True grouping structure can be accurately identified under certain conditions.
A new model captures financial asset returns' tail behaviors and outperforms GARCH family.
problem Capturing the dynamic tail behaviors of financial asset returns.
method Combines LSTM with a novel parametric quantile function.
result Out-of-sample forecasts of conditional quantiles or VaR outperform GARCH family.
Proposes a new approach to approximate maximum likelihood for complex models.
problem Intractable likelihood functions in complex parametric models.
method Simulation-based constrained approximation to the structural model.
result Estimators nearly as efficient as maximum likelihood, feasible in many cases.
We propose an elementary model to price European physical delivery swaptions in multicurve setting with a simple exact closed formula. The proposed model is very parsimonious: it is a three-parameter multicurve extension of the two-parameter Hull-White (1990) model. The model allows also to obtain simple formulas for a…
A new method for clustering functional data outperforms existing methods.
problem Clustering heterogeneous functional linear regression data.
method funWeightClust, a family of parsimonious models based on cluster weighted models.
result funWeightClust outperforms existing methods in simulations and real-world traffic analysis.
New method calibrates local volatility models to marginal distributions.
problem Calibrating local volatility models to specific marginal distributions.
method Inspired by volatility interpolation, constructs time-homogeneous or continuous local volatility functions.
result Efficient numerical algorithms for constructing local volatility functions.
A new clustering method for functional data using skewed distributions.
problem Clustering functional data with skewed distributions.
method Mixtures of functional linear regression models and three skewed multivariate distributions (variance-gamma, skew-t, normal-inverse Gaussian).
result The proposed method funWeightClustSkew performs well on simulated and real data.
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.
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.
The paper simplifies electricity market curves with less parameters.
problem Modeling electricity prices and demands efficiently.
method Mesh-free interpolation using radial basis functions.
result The method reduces parameters needed to represent curves.
Investigates deep hedging under rough volatility models.
problem Performance of deep hedging framework under non-Markovian conditions.
method Analysis of rough volatility models, use of parsimonious network architectures.
result Parsimonious network architectures can capture non-Markovian time-series.
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.
New neural network models for complex functional data analysis.
problem Complex relations between functional predictors and responses.
method Function-on-Function regression models using neural networks with continuous hidden layers.
result Demonstrated power and flexibility in handling complex functional models.
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.
Koopman Regularizationmath.DS
Koopman Regularization learns governing equations from sparse data.
problem Learning governing equations from sparse and corrupted data.
method Constrained optimization using Koopman Eigenfunctions.
result Restores dynamics precisely with minimal assumptions.
We address two shortcomings in online travel time estimation methods for congested urban traffic. The first shortcoming is related to the determination of the number of mixture modes, which can change dynamically, within day and from day to day. The second shortcoming is the wide-spread use of Gaussian probability dens…
A new method reduces high-dimensional data's impact on CWMs using TSNE.
problem High-dimensional data hampers CWMs' accuracy and speed.
method TSNE for dimensionality reduction, parsimonious technique, expectation maximization.
result TSNE enhances CWMs' performance in high-dimensional space.
Method selects most useful network model for various tasks.
problem Impact of translating raw data to network models is unexamined.
method Proposes a network model selection methodology focusing on utility and parsimony.
result Demonstrates the importance of network definition for system behavior.
Let be a nonabelian, simple group with a nontrivial conjugacy class . Let be a diagram of an oriented knot in , thought of as computational input. We show that for each such and , the problem of counting homomorphisms that send meridians of to is al…
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.
A new tensor regression model preserves multidimensional data structure.
problem Complex multidimensional data loses intrinsic connections and parameter explosion.
method Developed a parsimonious tensor regression model using Tucker structure and shrinkage penalization.
result The model outperforms benchmark models in forecasting.
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 …
Novel estimation methods improve MAR model accuracy for high-dimensional time series.
problem Limited estimation techniques for Matrix Autoregressive (MAR) models.
method Adapted Yule-Walker equations and Burg's method.
result Proposed methods achieve comparable model fit to VAR models.
Bayesian method reconstructs hidden higher-order interactions from network data.
problem Lack of explicit higher-order interactions in pairwise network data.
method Bayesian approach based on parsimony, infers higher-order structures when statistically supported.
result Demonstrated applicability to various datasets, synthetic and empirical.
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…
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…
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…
To model high dimensional data, Gaussian methods are widely used since they remain tractable and yield parsimonious models by imposing strong assumptions on the data. Vine copulas are more flexible by combining arbitrary marginal distributions and (conditional) bivariate copulas. Yet, this adaptability is accompanied b…
PASTIS method selects simple models from noisy data.
problem Selecting correct models from large candidate libraries.
method PASTIS (Parsimonious Stochastic Inference) using extreme value theory.
result PASTIS outperforms other methods in model identification and predictive capability.
The problem to accurately and parsimoniously characterize random series of events (RSEs) present in the Web, such as e-mail conversations or Twitter hashtags, is not trivial. Reports found in the literature reveal two apparent conflicting visions of how RSEs should be modeled. From one side, the Poissonian processes, o…
Solving for adversarial examples with projected gradient descent has been demonstrated to be highly effective in fooling the neural network based classifiers. However, in the black-box setting, the attacker is limited only to the query access to the network and solving for a successful adversarial example becomes much …
Options on infectious diseasesq-fin.CP
Model for valuing options on epidemic spread.
problem Valuation of options on epidemic spread during an outbreak.
method Stochastic differential SIR model for epidemic dynamics.
result Parsimonious model for option valuation on epidemic spread.
FAST optimizes additive segmentation for faster, more interpretable models.
problem Efficiently segmenting and interpreting complex datasets.
method Optimization framework for fast piecewise constant shape functions.
result 2 orders of magnitude faster than state-of-the-art methods.
Ordinal Regression (OR) aims to model the ordering information between different data categories, which is a crucial topic in multi-label learning. An important class of approaches to OR models the problem as a linear combination of basis functions that map features to a high dimensional non-linear space. However, most…