Formula for critical points of chi fields on manifolds.
problem Computing critical points of chi fields on general manifolds.
method Semi-analytic formula using Kac-Rice argument and Hessian matrix representation.
result Expression for expected value of critical points in high-threshold limit.
Gradient-flow helps find good minima in complex models.
problem Understanding why gradient-based algorithms work in non-convex optimization.
method Kac-Rice analysis and gradient-flow from statistical physics.
result Gradient-flow finds good global minima in the presence of many spurious local minima.
We extend Kac-Rice formula to compute expected intersections of random submanifolds.
problem Computing expected intersections of random submanifolds.
method Generalized Kac-Rice formula using measure theory and integration.
result Formula computes expected cardinality of preimages of submanifolds via random maps.
Method analyzes complexity of empirical risk landscapes for generalized linear models.
problem Understanding the complexity of empirical risk landscapes in generalized linear models.
method Kac-Rice method and replicated method from theoretical physics.
result Explicit variational formulas for the number of critical points of empirical risk landscapes.
We analyze the landscape of empirical risk minimization for high-dimensional models, predicting phase transitions and critical point properties.
problem Understanding the complexity and structure of high-dimensional empirical risk landscapes.
method Using the Kac-Rice formula, we analyze the expected number of critical points and their spectral properties, providing detailed predictions.
result We derive complete topological phase diagrams for the phase retrieval problem, predicting BBP-type transitions and critical point stability.
Study finds the number of modes in Gaussian kernel density estimators scales with sqrt(β log β).
problem Determining the number of clusters in Transformers.
method Used Kac-Rice formula and Edgeworth expansion to prove scaling.
result The expected number of modes scales as Θ(√(β log β)).
We establish a few formulas that compute the volume of the zero-set (or nodal set) of a function on a compact Riemannian manifold as integrals of functionals of the function and its derivatives.
Develops calculus for random submanifolds using zonoids.
problem Calculating properties of random submanifolds defined by zero sets of vector fields.
method Defines zonoid sections and uses them to compute expected volumes and currents.
result Establishes new inequalities and formulas for random submanifolds.
The study of topological properties of random smooth maps, focusing on Kac-Rice formula and Betti numbers.
problem Topological and geometric properties of random smooth maps.
method Developed a general framework for differential geometric and topological issues of smooth Gaussian Random Fields, generalized Kac-Rice formula, applied to Kostlan random polynomials, and proved an original theorem in Differential Topology.
result The Betti numbers of the solution of a system of regular equations cannot decrease under a C0-small perturbation of the equations. The paper analyzes local minima in high-dimensional empirical risk minimization.
problem Understanding local minima in high-dimensional data models.
method Using Kac-Rice formula and proportional asymptotics, the paper derives bounds on local minima.
result Sharp asymptotics on estimation and prediction errors are derived.
Non-convex optimization with local search heuristics has been widely used in machine learning, achieving many state-of-art results. It becomes increasingly important to understand why they can work for these NP-hard problems on typical data. The landscape of many objective functions in learning has been conjectured to …
Study on complexity of random polynomials with deterministic spikes, identifying phase transitions.
problem Complexity of random Gaussian polynomials with deterministic spikes on a sphere.
method Variational formulas, Kac-Rice formula, determinant asymptotics of finite-rank perturbation of Gaussian Wigner matrices.
result Identification of a topological phase transition in the complexity function.
Study on variance of Laplace eigenfunctions on manifolds.
problem Investigating the variance of Laplace eigenfunctions on compact manifolds.
method Combining Kac-Rice formula, Wiener-Itô chaos decompositions, and pointwise Weyl law analysis.
result Established a quantitative bound for the fluctuations of nodal volumes, improving existing results.
We study rough high-dimensional landscapes in which an increasingly stronger preference for a given configuration emerges. Such energy landscapes arise in glass physics and inference. In particular we focus on random Gaussian functions, and on the spiked-tensor model and generalizations. We thoroughly analyze the stati…
In this work we analyse quantitatively the interplay between the loss landscape and performance of descent algorithms in a prototypical inference problem, the spiked matrix-tensor model. We study a loss function that is the negative log-likelihood of the model. We analyse the number of local minima at a fixed distance …
Non-asymptotic tail bounds for Kostlan-Shub-Smale field on sphere
problem Estimating rank-R symmetric signal tensor from Gaussian observation
method Profile maximum likelihood estimator
result Finite-(k,d) error bound recovers asymptotically optimal rate
Study analyzes landscape complexity of empirical loss functions with correlated data.
problem Understanding the complexity of loss landscapes in machine learning with structured data.
method Kac-Rice formula and random matrix theory applied to high-dimensional empirical loss functions.
result Characterizes the average number of critical points in loss functions with structured data.
Consider a d×d matrix M whose rows are independent centered non-degenerate Gaussian vectors ξ1,...,ξd with covariance matrices Σ1,...,Σd. Denote by Ei the location-dispersion ellipsoid of ξi:Ei=x∈Rd:x⊤Σi−1x⩽1. We sh…
Formulas for curvature measures of sublevel sets on manifolds derived from function and derivatives.
problem Calculating intrinsic volumes of sublevel sets on Riemannian manifolds.
method Established formulas involving integrals of functionals of function and its derivatives.
result Formulas for intrinsic volumes of sublevel sets on Riemannian manifolds.
New test detects sparse alternatives in Gaussian random fields.
problem Detecting sparse alternatives in Gaussian random fields.
method Ad-hoc Kac Rice formula for second maximum distribution, exact spacing test.
result Exact t-spacing test for high power in detecting sparse alternatives. Efficient private matrix analysis algorithms for recent variants.
problem Private analysis of recent matrix updates.
method Identifying sufficient conditions on positive semidefinite matrices.
result First efficient differentially private algorithms for various matrix analysis tasks.
This paper introduces compositional data analysis for financial ratios, improving industry-level analysis.
problem Statistical issues with standard financial ratios at industry level.
method Compositional data analysis techniques for financial ratios.
result Improved analysis of financial ratios using compositional data methods.
In this dissertation, the main goal is visualisation of financial time series. We expect that visualisation of financial time series will be a useful auxiliary for technical analysis. Firstly, we review the technical analysis methods and test our trading rules, which are built by the essential concepts of technical ana…
Paper combines geometry and time-series analysis for spatiotemporal data.
problem Multivariate time-series data from multiple sensors.
method Combines manifold learning, Riemannian geometry, and spectral analysis.
result Proposes Riemannian multi-resolution analysis (RMRA) for dynamic mode extraction.
In this paper the exact linear relation between the leading eigenvectors of the modularity matrix and the singular vectors of an uncentered data matrix is developed. Based on this analysis the concept of a modularity component is defined, and its properties are developed. It is shown that modularity component analysis …
This paper investigates to identify the requirement and the development of machine learning-based mobile big data analysis through discussing the insights of challenges in the mobile big data (MBD). Furthermore, it reviews the state-of-the-art applications of data analysis in the area of MBD. Firstly, we introduce the …
Interactive DR framework for comparing datasets.
problem Limited flexibility in existing DR methods for comparative analysis.
method Unified linear comparative analysis (ULCA) with interactive optimization and visualization.
result ULCA and optimization algorithm improve comparative analysis efficiency and flexibility.
This paper reviews R packages for automating data analysis tasks.
problem Time-consuming Exploratory Data Analysis in large, noisy data sets.
method Systematic review of 12 R packages for autoEDA.
result Identifies automated tasks and areas for future development.
Improves transparency of deep neural networks through feature and consistency analysis.
problem Black-box nature of deep learning inference limits transparency for safety-critical systems.
method Structural and linguistic feature analysis, consistency analysis.
result 75% of human workers found input data and results consistent, 70% found inference and results consistent.
Combines topological and geometric approaches to data analysis.
problem Understanding when and how geometric objects intersect.
method Connects topological and geometric concepts of curvature.
result Reconceptualizes curvature and links it to hyperconvexity.
Proposes a multivariate regression model for better analysis of multiple datasets.
problem Insufficient performance of single-dataset analysis in integrative studies.
method Sparse estimation for variable and group selection, alternating direction method of multipliers algorithm.
result Demonstrated improved performance through simulations and real data analysis.
New method uses topological data analysis to study stock market crashes.
problem Characterizing and predicting stock market crashes.
method Topological data analysis, persistence landscape, dynamic time series analysis.
result Demonstrates effectiveness of new method for Flash Crash characterization and prediction.
Analyzes stock trends and e-commerce user behavior using Twitter data.
problem Understanding the relationship between stock prices, stock news, and e-commerce user behavior.
method Cross-domain analysis using Hadoop, Hive, and Tableau on three datasets.
result Identified correlations between stock sentiment, stock trends, and e-commerce user behavior.
Analyzes changes in cryptocurrency market structure.
problem Understanding shifts in cryptocurrency market dynamics.
method Structural change analysis techniques.
result Identifies key structural changes in the market.
Genetic programming optimizes Gaussian kernels for better sentiment analysis.
problem Improving accuracy of sentiment analysis in text.
method Genetic Programming applied to evolve more effective Gaussian kernels.
result The evolved kernels outperform traditional Gaussian Processes in sentiment analysis.
Study analyzes Disney stock market performance using machine learning.
problem Forecasting stock market performance of Disney.
method Exploratory data analysis, feature engineering, model selection (linear regression).
result Linear regression model performed best.
This study analyzes data science vocabulary changes over 13 years.
problem Understanding evolution of data science terms over time.
method Exploratory Data Analysis, Latent Semantic Analysis, Latent Dirichlet Analysis, N-grams Analysis.
result Identified new vocabulary and its incorporation into scientific literature.
FinSphere improves stock analysis quality with AI and expert-curated data.
problem Lack of objective evaluation metrics and depth in stock analysis by FinLLMs.
method Developed AnalyScore, curated Stocksis dataset, and FinSphere AI agent.
result FinSphere outperforms general and domain-specific LLMs in generating high-quality stock analysis reports.
Random forest identifies key features for diagnosing machine faults.
problem Identifying specific factors causing machine faults.
method Gaussian mixture model clustering, spectrum analysis, random forest classification.
result Identified significant features for different machine states.
This study examines whether PCA can effectively identify nitrogen pollution sources in rivers.
problem Identifying pollution sources in rivers for effective environmental management.
method Principal Component Analysis and its modifications, along with Independent Component Analysis and Factor Analysis, are applied to nitrogen pollution source identification.
result PCA and related techniques can be powerful tools for uncovering nitrogen pollution sources in rivers.
We present a unifying framework which reduces the construction of probabilistic component analysis techniques to a mere selection of the latent neighbourhood, thus providing an elegant and principled framework for creating novel component analysis models as well as constructing probabilistic equivalents of deterministi…
Paper introduces probabilistic methods to approximate archetypal analysis, reducing complexity.
problem Inherent computational complexity of archetypal analysis limits its practical applicability.
method Two preprocessing techniques: dimensionality reduction and representation cardinality reduction, using probabilistic geometry.
result The method effectively reduces scaling and provides near-optimal solutions for prediction errors.
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…
DeepCAM learns convolutional dictionaries for image processing.
problem Processing high-dimensional signals like images efficiently.
method Introduces a Deep Convolutional Analysis Dictionary Model (DeepCAM) using convolutional dictionaries.
result DeepCAM achieves performance comparable to other methods on single image super-resolution.
Improved LDA method for better classification and dimensionality reduction.
problem Improving linear discriminant analysis for better classification performance.
method Integrates spectrally-corrected covariance matrix and regularized discriminant analysis.
result SRLDA has a linear classification global optimal solution under spiked model assumption.
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.
The kernel matrix used in kernel methods encodes all the information required for solving complex nonlinear problems defined on data representations in the input space using simple, but implicitly defined, solutions. Spectral analysis on the kernel matrix defines an explicit nonlinear mapping of the input data represen…
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…