Deep learning techniques are rapidly advanced recently, and becoming a necessity component for widespread systems. However, the inference process of deep learning is black-box, and not very suitable to safety-critical systems which must exhibit high transparency. In this paper, to address this black-box limitation, we …
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,932 papers · 148 categories
Trend · papers per month
48 results for “consistency analysis”
Study assesses consistency and reproducibility of LLMs in finance and accounting tasks.
problem Consistency and reproducibility of LLM outputs in finance and accounting research.
method Extensive experimentation with 50 independent runs across 5 tasks using 3 OpenAI models.
result Task-specific patterns of consistency and reproducibility, with binary classification and sentiment analysis achieving near-perfect reproducibility.
The paper examines the consistency of Lasso regression applied to signature analysis of time series data.
problem Consistency of Lasso regression in signature analysis of time series data.
method The paper studies the consistency of Lasso regression applied to signature analysis of time series data, both theoretically and numerically.
result The Lasso regression is consistent both asymptotically and in finite sample for certain types of time series and processes.
The paper proves consistency of archetypal analysis for multivariate data.
problem Finding optimal archetype points for multivariate data.
method Uses convex polytope to summarize data, proving consistency under specific distribution assumptions.
result Archetype points converge to optimal solution under certain conditions.
In this paper we study the consistency of an empirical minimum error entropy (MEE) algorithm in a regression setting. We introduce two types of consistency. The error entropy consistency, which requires the error entropy of the learned function to approximate the minimum error entropy, is shown to be always true if the…
Study improves -consistency bounds for regression analysis.
problem Improving -consistency bounds for regression analysis.
method Generalized theorems and novel -consistency bounds for various surrogate loss functions.
result Derives principled surrogate losses for adversarial regression.
Paper introduces elastic consistency for distributed SGD, enabling convergence analysis.
problem Training large-scale machine learning models in distributed environments.
method Introduces elastic consistency as a general consistency model for distributed SGD.
result Derives convergence bounds for various distributed SGD methods.
MixML unifies analysis of weakly consistent parallel learning.
problem Lack of insight into how communication structure affects convergence in parallel learning.
method Proposes MixML framework for analyzing convergence of weakly consistent parallel machine learning.
result Shows dependency of convergence on mixing time tmix.
Consistent estimator for mixtures of nonparametric elliptical distributions helps cluster analysis.
problem Consistency of maximum likelihood estimator for mixtures of nonparametric elliptical distributions.
method Maximum likelihood estimation for mixtures of elliptically-symmetric distributions under nonparametric .
result Components of the estimator correspond to well-separated components of the underlying distribution .
Researchers analyze the relationship between ML cost functions and the C-index in survival analysis.
problem Understanding the relationship between ML cost functions and the C-index in survival analysis.
method Provided C-index Fisher-consistency results and excess risk bounds for various cost functions in survival analysis.
result Identified conditions under which ML cost functions are consistent with the C-index.
Proposes a neural network method to improve consistencies in high dimensional data analysis.
problem Inconsistencies among dimensionality reduction, clustering, and visualization tasks in high dimensional data analysis.
method Consistent Representation Learning (CRL) neural network that performs NLDR transformations to satisfy LGP constraints.
result Improves consistencies in data interpretation through end-to-end task execution.
New method shows spectral clustering is consistent with theoretical guarantees.
problem Lack of theoretical support for anchor-based spectral clustering.
method Defined and analyzed a specific anchor-based algorithm.
result Theoretical consistency of the method in asymptotic settings.
The top- error is often employed to evaluate performance for challenging classification tasks in computer vision as it is designed to compensate for ambiguity in ground truth labels. This practical success motivates our theoretical analysis of consistent top- classification. Surprisingly, it is not rigorously und…
Sharpe Ratio Analysis in High Dimensions: Residual-Based Nodewise Regression in Factor Modelsq-fin.PM
New method for Sharpe ratio analysis in high dimensions using residual-based nodewise regression.
problem Consistency of Sharpe ratio estimators in high-dimensional portfolios.
method Residual-based nodewise regression for estimating precision matrix of errors and returns.
result Consistent Sharpe ratio estimators in various portfolio settings.
We establish the consistency of an algorithm of Mondrian Forests, a randomized classification algorithm that can be implemented online. First, we amend the original Mondrian Forest algorithm, that considers a fixed lifetime parameter. Indeed, the fact that this parameter is fixed hinders the statistical consistency of …
In this paper we provide a flexible framework allowing for a unified study of time consistency of risk measures and performance measures (also known as acceptability indices). The proposed framework not only integrates existing forms of time consistency, but also provides a comprehensive toolbox for analysis and synthe…
In many countries information on expectations collected through consumer confidence surveys are used in macroeconomic policy formulation. Unfortunately, before doing so, the consistency of responses is often not taken into account, leading to biases creeping in and affecting the reliability of the indices hence created…
Majority-of-Three is Optimalstat.ML
Majority-of-Three is Optimal
problem Optimality of Voting Learners
method Majority vote of three classifiers
result Proves optimality for the simplest voting scheme
Classifies shapes of yield curves in the Svensson family.
problem Classifying shapes of yield curves in the Svensson family.
method Complete classification of shapes using mathematical analysis.
result Certain complex shapes cannot appear after a deterministic time horizon.
On the Consistency of Maximum Likelihood Estimation of Probabilistic Principal Component Analysisstat.ML
New approach resolves ambiguity in PPCA model's maximum likelihood estimation.
problem Ambiguity in maximum likelihood estimation of PPCA model due to rotational symmetry.
method Using quotient topological spaces, the approach resolves ambiguity and shows consistency of the maximum likelihood solution.
result Maximum likelihood solution is consistent in an appropriate quotient Euclidean space.
Tensor decomposition on big data has attracted significant attention recently. Among the most popular methods is a class of algorithms that leverages compression in order to reduce the size of the tensor and potentially parallelize computations. A fundamental requirement for such methods to work properly is that the lo…
The paper analyzes consistency of graph-based semi-supervised learning methods for binary and multi-class classification.
problem Consistency of semi-supervised learning algorithms on graphs with noisy labels and well-clustered unlabelled data.
method The study examines graph-based probit and one-hot encoding methods for binary and multi-class classification, analyzing the consistency of optimization-based techniques.
result The analysis reveals insights into the rational function choice for optimization, improving the consistency of semi-supervised learning algorithms.
New analysis proves consistency for adaptive Bayesian quadrature methods.
problem No theoretical guarantees for adaptive Bayesian quadrature methods.
method Introduces weak adaptivity and proves consistency for a broad class of adaptive Bayesian quadrature rules.
result Proves consistency and derives non-tight but informative convergence rates for adaptive Bayesian quadrature methods.
Theoretical analysis of cross-entropy loss functions and their robustness.
problem Guarantees for using cross-entropy as a surrogate loss function.
method Theoretical analysis of a broad family of loss functions, including cross-entropy.
result First -consistency bounds for comp-sum losses and smooth adversarial comp-sum losses.
CycleMorph improves image registration by preserving topology with cycle consistency.
problem Preserving original topology during deformation in image registration.
method Cycle-consistent deformable image registration approach.
result Effective and accurate registration on diverse image pairs within seconds.
We improve adversarial robustness calibration analysis for broader hypothesis sets.
problem Improving calibration for adversarial robustness in machine learning.
method A finer definition of calibration for adversarial robustness.
result Our results cover most common hypothesis sets in machine learning.
The study investigates the consistency of -means clustering under finite expectation assumptions.
problem Consistency of -means clustering under finite expectation assumptions.
method Investigates the conditions under which -means clustering is consistent, considering finite expectation instead of finite variance.
result Inconsistency can arise due to extreme cluster imbalance, leading to some clusters having few points.
Asymptotically consistent clustering algorithms for ergodic stochastic processes are developed.
problem Clustering stochastic processes with consistency guarantees.
method Review and development of clustering algorithms for ergodic stochastic processes.
result Asymptotically consistent clustering algorithms can be obtained for ergodic stochastic processes.
Decoding Financial Health in Kenyas' Medical Insurance Sector: A Data-Driven Cluster Analysisq-fin.CP
Study clusters Kenyan medical insurance companies based on financial performance and reporting consistency.
problem Identifying financial health and reporting consistency in Kenyan medical insurance companies.
method Advanced clustering techniques (KMeans, DTW) on financial ratios and time series data.
result Four distinct clusters identified, each representing different financial performance and reporting consistency combinations.
Develops consistent approximations for composite optimization problems.
problem Significant errors in solutions due to approximations in optimization problems.
method Specifies conditions for well-behaved approximations in minimizers, stationary points, and level-sets for a broad class of composite problems.
result Framework of consistent approximations for composite problems, including stochastic, neural-network, and multi-objective optimization.
This technical report proves components consistency for the Doubly Stochastic Dirichlet Process with exponential convergence of posterior probability. We also present the fundamental properties for DSDP as well as inference algorithms. Simulation toy experiment and real-world experiment results for single and multi-clu…
Spectral density matrix estimation of multivariate time series is a classical problem in time series and signal processing. In modern neuroscience, spectral density based metrics are commonly used for analyzing functional connectivity among brain regions. In this paper, we develop a non-asymptotic theory for regularize…
Proof of Gaussian ML estimator consistency in linear auto-regressive models.
problem Consistency of Gaussian maximum likelihood estimator in linear auto-regressive models.
method Information-theoretic proof without stability assumptions.
result Nearly optimal non-asymptotic rates for parameter recovery.
A new framework integrates classification and regression tasks in multi-task learning.
problem Jointly solving classification and regression tasks in multi-task scenarios.
method Two-Stage Learning-to-Defer (L2D) framework with a unified deferral mechanism.
result Unified deferral mechanism ensures convergence to the Bayes-optimal rejector.
Regularized M-estimators are used in diverse areas of science and engineering to fit high-dimensional models with some low-dimensional structure. Usually the low-dimensional structure is encoded by the presence of the (unknown) parameters in some low-dimensional model subspace. In such settings, it is desirable for est…
WPCA improves subspace recovery robustness to outliers.
problem Improving subspace recovery in the presence of outliers.
method Winsorized PCA (WPCA) with theoretical analysis of accuracy and robustness.
result WPCA provides consistent subspace recovery from contaminated data.
Dynamic submodular maximization with consistency constraints.
problem Maximizing submodular functions in a streaming environment with limited changes.
method Algorithms with trade-offs between consistency and approximation quality.
result Effective algorithms for real-world applications.
In this paper, we explore the effectiveness of dynamic analysis techniques for identifying malware, using Hidden Markov Models (HMMs) and Profile Hidden Markov Models (PHMMs), both trained on sequences of API calls. We contrast our results to static analysis using HMMs trained on sequences of opcodes, and show that dyn…
FMM fails to accurately determine the number of components even with consistent posterior.
problem Determining the number of subpopulations in a data set using FMM.
method Analysis of FMM component-count posterior under model misspecification.
result FMM component-count posterior diverges under model misspecification, contrary to intuition.
Cluster Analysis on Locally Asymptotically Self-similar Processes with Known Number of Clustersstat.ML
We conduct cluster analysis on a class of locally asymptotically self-similar stochastic processes, which includes multifractional Brownian motion as a representative. When the true number of clusters is supposed to be known, a new covariance-based dissimilarity measure is introduced, from which we obtain the approxima…
New algorithms for regression with adversarial responses on various metric spaces.
problem Regression with adversarial responses under non-i.i.d. sequences.
method Proves universal consistency for a wide range of non-stationary processes.
result Achieves universal consistency for a broader class of sequences than stationary processes.
We propose a novel approach for analysis of the composition of an equity mutual fund based on the time series decomposition of the price movements of the individual stocks of the fund. The proposed scheme can be applied to check whether the style proclaimed for a mutual fund actually matches with the fund composition. …
New algorithms for latent class analysis using regularized spectral clustering.
problem Identifying latent classes within populations from categorical data.
method Developed two new algorithms using a regularized Laplacian matrix to estimate latent classes.
result Our algorithms provide consistent latent class analysis under mild conditions and can accurately infer the number of latent classes.
Consistency models accelerate generation with theoretical guarantees.
problem Empirical success of consistency models without theoretical justification.
method Theoretical analysis of consistency models mapping inputs to arbitrary points.
result Achieve KL divergence of order with $ O\left(\log\left(\frac{d}{\varepsilon}
ight)
ight) $ iterations.
Localized Sparse Principal Component Analysis of Multivariate Time Series in Frequency Domainstat.ME
The paper introduces a method for interpretable principal component analysis of high-dimensional time series.
problem Inconsistent and difficult-to-interpret principal component estimates in high-dimensional regimes.
method Localized sparse principal component analysis of spectral density matrices in frequency domain.
result Efficient algorithm for sparse-localized estimates of principal subspaces.
Algorithm estimates nonparametric mixtures from grouped data.
problem Estimating identifiable nonparametric mixture models from grouped observations.
method Oracle inequality for weighted kernel density estimators and general consistency result.
result Consistent estimation of mixture components from grouped observations.
Estimates multiple related causal graphs with shared causal order.
problem Discovering multiple related Gaussian DAGs with shared causal order.
method Proposes a -regularized MLE for joint estimation of linear structural equation models.
result Joint estimator achieves better sample complexity and consistency in causal order recovery.
New methods for parameter estimation in mechanistic models using data-consistent inversion.
problem Parameter estimation bias in Bayesian analysis for mechanistic models.
method Data-consistent inversion methods based on rejection sampling, MCMC, GANs, and constrained optimization.
result Improved parameter estimation without bias from uninformative priors.