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

226452677903 · Jun 202019922001200920172026
48 results for distributed analysis

Paper proposes distributed sparse multicategory discriminant analysis for classification.

problem Sparse multicategory classification with distributed data.
method Convex formulation, distributed setting, invariant discriminant subspace recovery.
result Distributed sparse multicategory linear discriminant analysis performs as good as centralized version after a few rounds of communications.

Regularizes ML algorithms for robust multivariate analysis against distribution shifts.

problem Ensuring robustness of multivariate analysis algorithms against distribution shifts.
method Integrates a causal regularisation term into the loss function of multivariate analysis algorithms.
result Demonstrates improved out-of-distribution generalisation with reduced-rank regression and partial least squares.

Improved image learning using elliptically contoured tensor-variate distributions.

problem Inadequate statistical analysis for tensor-valued data, especially with heavier or lighter tails.
method Developed a family of elliptically contoured tensor-variate distributions and derived their properties and procedures for estimation.
result Tensor-variate classification rules and tensor-on-tensor regression better predict and characterize data than TVN-based methods.

CDVI improves variational inference for survival analysis by considering censoring mechanisms.

problem Challenges in applying variational methods to survival data, especially the dependence on censoring.
method Censor-dependent variational inference (CDVI) tailored for latent variable models in survival analysis.
result Significant improvements in estimating individual survival distributions.

This paper analyzes sampling from heavy-tailed distributions using discretized Itô diffusions.

problem Sampling from heavy-tailed distributions with finite variance.
method Mean-square analysis of discretized Itô diffusions with weighted Poincaré inequalities.
result Explicit iteration complexity for obtaining samples close to target distributions in Wasserstein-2 metric.

In this paper, we propose a data collaboration analysis method for distributed datasets. The proposed method is a centralized machine learning while training datasets and models remain distributed over some institutions. Recently, data became large and distributed with decreasing costs of data collection. If we can cen…

2019-02-20abs ↗pdf ↗

We study the risk performance of distributed learning for the regularization empirical risk minimization with fast convergence rate, substantially improving the error analysis of the existing divide-and-conquer based distributed learning. An interesting theoretical finding is that the larger the diversity of each local…

2018-12-19abs ↗pdf ↗

Proposes EDM algorithm to accelerate model training in distributed networks.

problem Hindered effectiveness of distributed stochastic optimization algorithms due to data heterogeneity and network sparsity.
method Introduces Exact-Diffusion with Momentum (EDM) algorithm, incorporating momentum techniques to mitigate bias and enhance convergence rate.
result EDM algorithm converges sub-linearly to the optimal solution, radius independent of data heterogeneity, for non-convex objective functions.

Sharp analysis of out-of-distribution error in overparameterized models with importance weights.

problem Understanding and quantifying the degradation of performance in overparameterized models when faced with underrepresented data.
method Sharp analysis of an overparameterized Gaussian mixture model with spurious features and cost-sensitive interpolating solutions incorporating importance weights.
result Characterization of a novel tradeoff between worst-case robustness and average accuracy as a function of importance weight magnitude.

The study tackles modeling high-frequency financial data using continuous distributions, finding them inadequate.

problem Challenges in modeling high-frequency integer price changes with continuous distributions.
method Proposed a modified maximum likelihood estimation procedure to account for the discreteness of high-frequency price changes.
result Traditional GARCH models are not suitable for high-frequency data due to the discreteness of price changes.

DCMA uses generative models to analyze treatment effects on entire outcome distributions.

problem Traditional mediation analysis focuses on summary contrasts, missing complex distributional changes.
method DCMA learns conditional generative models for mediators and outcome, reconstructing interventional distributions via Monte Carlo simulation.
result DCMA captures both summary effects and rich distributional contrasts like energy distance and Wasserstein distance.

This paper tackles distributed estimation of the top-L eigenspace in PCA for large data sets.

problem Challenges in estimating the top-L eigenspace in principal component analysis for large data sets.
method Proposes a novel multi-round algorithm using shift-and-invert preconditioning and convex optimization.
result Achieves a fast convergence rate and covers the targeted top-L eigenspace without explicit eigengap assumption.

DCMA uses generative models to analyze complex treatment effects on outcome distributions.

problem Analyzing complex and nonlinear causal mechanisms through outcome-level summary contrasts.
method Generative learning framework for identifying and estimating treatment effects on entire outcome distributions.
result Reconstructs interventional outcome distributions via Monte Carlo forward simulation, capturing both summary and distributional contrasts.

Data describing historical economic growth are analysed. Included in the analysis is the world and regional economic growth. The analysis demonstrates that historical economic growth had a natural tendency to follow hyperbolic distributions. Parameters describing hyperbolic distributions have been determined. A search …

2015-09-09abs ↗pdf ↗

New robust discriminant analysis for non-Gaussian data.

problem Classical discriminant analysis struggles with non-Gaussian distributions and contaminated datasets.
method Each data point follows its own ES distribution with arbitrary scale, leading to robust classification.
result Maximum-likelihood estimation and classification are simple, fast, and robust.

New algorithms improve distributional TD learning with linear approximations.

problem Estimating return distributions in reinforcement learning.
method Fine-grained analysis of linear-categorical Bellman equation, variance reduction techniques.
result Tight sample complexity bounds for distributional TD learning with linear approximations.

Analyzes how economic policies affect wealth distribution in Bitcoin token economy.

problem Impact of economic policies on wealth distribution in token economies.
method Eliminated noise in wealth distribution data using macroeconomic and microeconomic time series. Causality analysis between BIPs and wealth distribution data.
result Proposed a structure for economic policy taxonomy in token economies.

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 PP.
result Components of the estimator correspond to well-separated components of the underlying distribution PP.

Study on distributional TD learning with linear approximations for better return estimation.

problem Estimating the return distribution of a policy in reinforcement learning.
method Finite-sample analysis of distributional TD learning with linear function approximation, using the linear-categorical Bellman equation and exponential stability arguments for products of random matrices.
result Sample complexity of linear distributional TD learning matches that of classic linear TD learning, indicating similar difficulty in estimating return distribution versus its expectation.

Unified analysis of efficient local training methods for distributed variational inequalities.

problem Efficient distributed/federated learning for variational inequality problems.
method Unified convergence analysis of communication-efficient local training methods.
result First local gradient descent-accent algorithms with improved communication complexity.

Develops asymptotic analysis for RandNLA sampling estimators in least-squares problems.

problem Lack of distributional information for RandNLA estimators in statistical inference.
method Asymptotic analysis of sampling estimators for least-squares problems in two settings.
result Sampling estimators are asymptotically normally distributed under mild conditions.

CNFs learn distributions from samples with error bounds.

problem Learning probability distributions from finite samples.
method Continuous normalizing flows with linear interpolation and flow matching objective function.
result Non-asymptotic error bounds for distribution estimator in Wasserstein-2 distance.

Prototypal analysis is introduced to overcome two shortcomings of archetypal analysis: its sensitivity to outliers and its non-locality, which reduces its applicability as a learning tool. Same as archetypal analysis, prototypal analysis finds prototypes through convex combination of the data points and approximates th…

2017-01-31abs ↗pdf ↗

Unified framework for robust discriminant analysis overcomes Gaussian assumptions.

problem Challenges in linear and quadratic discriminant analysis with non-Gaussian or contaminated data.
method FEMDA framework considers arbitrary Elliptically Symmetrical (ES) distributions with flexible scale parameters.
result Maximum-likelihood parameter estimation and classification are robust and efficient.

Develops a Riemannian archetypal analysis for interpretable non-linear data.

problem Limited performance of classical archetypal analysis on non-linear data.
method Riemannian geometry for data-driven pullback, geodesic convex combinations, convex relaxation followed by non-convex refinement.
result Combines interpretability of classical archetypal analysis with expressive power of modern non-linear models.

This study analyzes satellite communication latency using a stochastic geometry model.

problem Latency analysis of LEO satellite relay communication systems.
method Stochastic geometry framework with spherical BPP models, suboptimal satellite relay selection strategy.
result Derives distance distributions and analytical expressions for transmission delays.

The paper addresses evaluating survival predictions using discrimination measures, finding a robust method to convert distributions to risks.

problem Evaluating survival distribution predictions with discrimination measures is challenging and often leads to unfair comparisons.
method The paper surveys existing methods and recommends summing over the predicted cumulative hazard as the most robust method to convert distributions to risks.
result Summing over the predicted cumulative hazard is the most robust method to convert distribution predictions to risk predictions.

This paper analyzes data-driven Newsvendor problems and finds a wide range of possible regrets.

problem Guessing the number drawn from an unknown distribution with asymmetric costs.
method Unified analysis using the notion of clustered distributions and new lower bounds.
result The entire spectrum of achievable regrets from 1/n1/\sqrt{n} to 1/n1/n is possible.

DFM models are analyzed for generating distributions with provable convergence.

problem Training DFM models to generate distributions that match true data.
method Theoretical analysis decomposes error into approximation and estimation errors.
result DFM models converge to true data distribution as training set size increases.

Quantifies polynomial approximation rates for smooth functions under various distributions.

problem Approximating smooth functions with polynomials under different distributional constraints.
method Develops a quantitative analogue of Carleman's theorem using complex analysis.
result Establishes superexponential rates of approximation for certain function classes over general distributions.

The paper proposes a neural network model for estimating conditional mixture Weibull distributions with right-censored data.

problem Survival analysis with right-censored data in predictive maintenance and health fields.
method A neural network architecture is developed to estimate two-parameter Weibull distributions conditionally to features, extending to a finite mixture of Weibull distributions.
result The model outperforms state-of-the-art methods on real-world datasets and can consider any survival time horizon.

A new robust and flexible classification method for non-Gaussian data.

problem Robustness to scale changes and non-Gaussian distributions in classical discriminant analysis.
method FEMDA uses arbitrary Elliptically Symmetrical distributions and scale parameters for each data point.
result FEMDA is robust to scale changes and outperforms other methods.

In this article we show the relationship between the Pareto distribution and the gamma distribution. This shows that the second one, appropriately extended, explains some anomalies that arise in the practical use of extreme value theory. The results are useful to certain phenomena that are fitted by the Pareto distribu…

2012-11-01abs ↗pdf ↗

Paper analyzes convergence of DDPM for general distributions.

problem Theoretical understanding of DDPM's convergence properties remains limited.
method Introduced a relaxed smoothness condition and proved near-optimal convergence rates.
result Established a convergence rate of \( \widetilde{O}\left(\frac{d\min\{d,L^2\}}{T^2} ight) \) in Kullback-Leibler divergence.