Taxicab correspondence analysis visualizes sparse text data sets.
problem Visualization of extremely sparse contingency tables.
method Robust variant of correspondence analysis for sparse data.
result Visualized an 8265-dimensional textual data set.
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,657 papers · 148 categories
Trend · papers per month
48 results for “taxicab correspondence analysis”
Study defines new products for Lorentzian spaces and analyzes causal diamonds.
problem Understanding causal diamonds in Lorentzian spaces.
method Introduced taxicab and uniform products for Lorentzian pre-length spaces. Defined space and analyzed its properties.
result The space is geodesic and globally hyperbolic for complete .
Graphs model human mobility patterns, reducing errors in data matching.
problem Lack of high-quality data and computational resources for graph-based mobility analysis.
method Embedding graphs into a continuous space to address matching, modeling, and visualization challenges.
result Approx 40% decrease in error on average in matched graphs vs unmatched ones.
Study geodesic extendibility on metric spaces and map them to a half-space.
problem Geodesic extendibility on metric spaces.
method Explicit isometry between and .
result Established group isometry between Iso(X,d) and Iso(Σ(X),d_H) for Hadamard spaces.
On the metric geometry of the space of compact balls and the shooting property for length spacesmath.MG
In this work we study the geodesic structure of the space of compact balls of a complete and locally compact metric length space endowed with the Hausdorff distance . In particular, we focus on a geometric condition (referred to as the shooting property) that enables us to give an explicit isometry between …
Real-time traffic volume inference is key to an intelligent city. It is a challenging task because accurate traffic volumes on the roads can only be measured at certain locations where sensors are installed. Moreover, the traffic evolves over time due to the influences of weather, events, holidays, etc. Existing soluti…
We present new findings in regard to data analysis in very high dimensional spaces. We use dimensionalities up to around one million. A particular benefit of Correspondence Analysis is its suitability for carrying out an orthonormal mapping, or scaling, of power law distributed data. Power law distributed data are foun…
cMCA uses contrastive learning to identify latent subgroups in political party data.
problem Identifying latent subgroups within political party data.
method Contrastive learning applied to multiple correspondence analysis (MCA).
result cMCA identifies latent subgroups not seen by traditional methods.
In this paper we study randomized optimal stopping problems and consider corresponding forward and backward Monte Carlo based optimisation algorithms. In particular we prove the convergence of the proposed algorithms and derive the corresponding convergence rates.
New framework segments 3D scenes using neural algorithms and sub-Riemannian geometry.
problem Effective scene segmentation in 3D vision.
method Neurogeometric sub-Riemannian model, harmonic analysis, neural-based stereo correspondence.
result Sub-Riemannian metric is central to effective scene segmentation.
Establishes correspondence between Calabi-Yau and Landau-Ginzburg structures.
problem Preserving real structures in the Calabi-Yau/Landau-Ginzburg correspondence.
method Detailed analysis of period integrals and modification of real structures.
result Full CY/LG correspondence for structures established.
Stable density-based clustering via multiparameter persistence.
problem Density-based clustering stability to data perturbations.
method Degree-Rips construction, correspondence-interleaving distance, multiparameter stability analysis.
result Persistable pipeline yields stable, consistent density-based clustering.
Correspondence analysis (CA) is a multivariate statistical tool used to visualize and interpret data dependencies. CA has found applications in fields ranging from epidemiology to social sciences. However, current methods used to perform CA do not scale to large, high-dimensional datasets. By re-interpreting the object…
We carry out the harmonic analysis on four Platonic spherical three-manifolds with different topologies. Starting out from the homotopies (Everitt 2004), we convert them into deck operations, acting on the simply connected three-sphere as the cover, and obtain the corresponding variety of deck groups. For each topology…
Inspired by the recent success of deep neural networks and the recent efforts to develop multi-layer dictionary models, we propose a Deep Analysis dictionary Model (DeepAM) which is optimized to address a specific regression task known as single image super-resolution. Contrary to other multi-layer dictionary models, o…
A Calabi-Yau orbifold is locally modeled on C^n/G where G is a finite subgroup of SL(n, C). In dimension n=3 a crepant resolution is given by Nakamura's G-Hilbert scheme. This crepant resolution has a description as a GIT/symplectic quotient. We use tools from global analysis to give a geometrical generalization of the…
Unified treatment of spacelike and timelike minimal surfaces via Liouville equation.
problem Investigating minimal surfaces in Lorentz-Minkowski space.
method Complex and paracomplex analysis, Möbius-type transformations, pseudo-isometries.
result Unified approach to both spacelike and timelike minimal surfaces.
We analyse a linear regression problem with nonconvex regularization called smoothly clipped absolute deviation (SCAD) under an overcomplete Gaussian basis for Gaussian random data. We propose an approximate message passing (AMP) algorithm considering nonconvex regularization, namely SCAD-AMP, and analytically show tha…
Study non-perturbative quantum geometry of string theories using finite difference equations and resurgence analysis.
problem Non-perturbative quantum geometry of open and closed topological string on the resolved conifold.
method Finite difference equations, resurgence analysis, exact WKB techniques.
result Identify 5d BPS states and relate spectral problems to quantum integrable systems.
Study optimal times to buy and sell stocks using support/resistance lines.
problem Optimal times to buy and sell stocks based on support and resistance lines.
method Mathematical model with probabilistic methods to solve optimal stopping problems.
result Best times to buy and sell stocks are determined by solving free boundary problems.
We carry out a Painlevé analysis of the systems of differential equations corresponding to the steady and the expanding, rotationally symmetric, gradient Ricci solitons on . For the steady case, dimensions of the form are singled out, with dimensions 2, 5, and 10 being particularly distinguished…
We consider the problem of signal recovery on graphs as graphs model data with complex structure as signals on a graph. Graph signal recovery implies recovery of one or multiple smooth graph signals from noisy, corrupted, or incomplete measurements. We propose a graph signal model and formulate signal recovery as a cor…
Many dynamical systems exhibit similar structure, as often captured by hand-designed simplified models that can be used for analysis and control. We develop a method for learning to correspond pairs of dynamical systems via a learned latent dynamical system. Given trajectory data from two dynamical systems, we learn a …
Lie Symmetry Classification and Numerical Analysis of KdV Equation with Power-law Nonlinearitymath.DG
In this paper, a complete Lie symmetry analysis of the damped wave equation with time-dependent coefficients is investigated. Then the invariant solutions and the exact solutions generated from the symmetries are presented. Moreover, a Lie algebraic classifications and the optimal system are discussed. Finally, using C…
How to reconcile Market Efficiency and Technical Analysiscond-mat.stat-mech
Weak form of the Efficiency Market Hypothesis (EMH) excludes predictions of future market movements from historical data and makes the technical analysis (TA) out of law. However the technical analysis is widely used by traders and speculators who steadely refuse to consider the market as a "fair game" and survive with…
Replicating Market Makersq-fin.MF
Method constructs CFMMs matching desired payoffs.
problem Creating CFMMs with specific payoff functions.
method Uses convex analysis and Fenchel conjugacy.
result Every concave, nonnegative, nondecreasing, 1-homogeneous payoff has a corresponding convex CFMM.
We consider the problem of learning regression functions from pairwise data when there exists prior knowledge that the relation to be learned is symmetric or anti-symmetric. Such prior knowledge is commonly enforced by symmetrizing or anti-symmetrizing pairwise kernel functions. Through spectral analysis, we show that …
Uniform bounds for neural networks' generalization error in overparameterized settings.
problem Generalization error in overparameterized neural networks.
method Neural Tangent kernel theory and Mercer decomposition of the NT kernel in spherical harmonics.
result Uniform generalization bounds for overparameterized neural networks in RKHS.
Isogeometric analysis is a recently developed computational approach that integrates finite element analysis directly into design described by non-uniform rational B-splines (NURBS). In this paper we show that price surfaces that occur in option pricing can be easily described by NURBS surfaces. For a class of stochast…
Smoothed analysis of complexity bounds and condition numbers has been done, so far, on a case by case basis. In this paper we consider a reasonably large class of condition numbers for problems over the complex numbers and we obtain smoothed analysis estimates for elements in this class depending only on geometric inva…
Cluster analysis of stocks using price movements of high frequency data from National Stock Exchangeq-fin.ST
This paper aims to develop new techniques to describe joint behavior of stocks, beyond regression and correlation. For example, we want to identify the clusters of the stocks that move together. Our work is based on applying Kernel Principal Component Analysis(KPCA) and Functional Principal Component Analysis(FPCA) to …
Correlated component analysis as proposed by Dmochowski et al. (2012) is a tool for investigating brain process similarity in the responses to multiple views of a given stimulus. Correlated components are identified under the assumption that the involved spatial networks are identical. Here we propose a hierarchical pr…
Paper proposes Adversarial CCA for multi-view alignment and generation.
problem Aligning multiple views in cross-view data analysis problems.
method Bayesian perspective, adversarial training for consistent latent encodings.
result ACCA model achieves superior performance in multi-view alignment and generation.
Sector-wise analysis of Indian stock market: Long and short-term risk and stability analysisq-fin.ST
The paper analyzes Indian stock sectors using multifractal analysis for long and short-term investment.
problem Investment risk and stability in Indian stock sectors.
method Sector-wise multifractal analysis of Bombay Stock Exchange, India, over short and long time scales.
result Long-term investment in stable sectors is more profitable, while sectors with large fluctuations may lead to downturns.
New method learns shape correspondences robustly from raw geometry.
problem Inaccurate and poor generalization of shape correspondences.
method Learning-based approach with feature-extraction network and functional map representation.
result Robust and accurate shape correspondence learning with less training data.
MALI aligns distinct domains using labeled data.
problem Aligning multi-domain data for machine learning.
method MALI learns manifold structure via diffusion and uses labeled data to guide alignment.
result MALI outperforms state-of-the-art methods across multiple datasets.
A random walk on image patchesphysics.data-an
In this paper we address the problem of understanding the success of algorithms that organize patches according to graph-based metrics. Algorithms that analyze patches extracted from images or time series have led to state-of-the art techniques for classification, denoising, and the study of nonlinear dynamics. The mai…
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.
New boundary conditions improve Hamiltonian analysis in GR.
problem Improving Hamiltonian analysis in GR with IBVP.
method Presented and analyzed new boundary conditions.
result New boundary conditions lead to better Hamiltonian analysis.
New analysis tightens memory capacity of Hopfield models using spherical codes.
problem Optimizing memory capacity in modern Hopfield models and Kernelized Hopfield Models.
method Connecting Hopfield models to spherical codes in information theory, establishing an optimal capacity bound and a sub-linear algorithm.
result First tight and optimal asymptotic memory capacity for modern Hopfield models, matching known lower bounds.
Posterior collapse in Variational Autoencoders (VAEs) arises when the variational posterior distribution closely matches the prior for a subset of latent variables. This paper presents a simple and intuitive explanation for posterior collapse through the analysis of linear VAEs and their direct correspondence with Prob…
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.
This paper analyzes how periodic and soft target updates stabilize linear Q-learning.
problem Theoretical explanation of stabilization mechanisms for linear Q-learning.
method Exact analysis using switched linear system dynamics and the joint spectral radius.
result Periodic and soft target updates can guarantee convergence to the exact projected Q-Bellman solution under specific conditions.
We introduce a factor analysis model that summarizes the dependencies between observed variable groups, instead of dependencies between individual variables as standard factor analysis does. A group may correspond to one view of the same set of objects, one of many data sets tied by co-occurrence, or a set of alternati…
Mixup improves model robustness and generalization by convexly combining examples.
problem Improving model robustness and generalization.
method Using Mixup augmentation in training, which involves convex combinations of pairs of examples and their labels.
result Mixup training helps models exhibit robustness to adversarial attacks and reduces overfitting.
Characterizes RFF regression in large setting, providing precise learning phases and double descent curve.
problem Characterizes RFF regression in large setting.
method Characterizes the exact asymptotics of random Fourier feature (RFF) regression in the realistic setting of large .
result Characterizes two qualitatively different phases of learning and the corresponding double descent test error curve.
Deep Survival Analysisstat.ML
The electronic health record (EHR) provides an unprecedented opportunity to build actionable tools to support physicians at the point of care. In this paper, we investigate survival analysis in the context of EHR data. We introduce deep survival analysis, a hierarchical generative approach to survival analysis. It depa…
Ancient pancake solutions found for curvature flows.
problem Finding unique ancient solutions to curvature flows.
method Constructing and analyzing -invariant ancient solutions.
result Unique -invariant ancient solutions found.