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.
This paper improves conditional multidimensional scaling for incomplete data.
Improved algorithm for multidimensional scaling reduces stress.
Global minima found for multidimensional scaling with penalties.
Multidimensional scaling is an important dimension reduction tool in statistics and machine learning. Yet few theoretical results characterizing its statistical performance exist, not to mention any in high dimensions. By considering a unified framework that includes low, moderate and high dimensions, we study multidim…
Classical multidimensional scaling is an important dimension reduction technique. Yet few theoretical results characterizing its statistical performance exist. This paper provides a theoretical framework for analyzing the quality of embedded samples produced by classical multidimensional scaling. This lays the foundati…
Develops statistical confidence sets for multidimensional scaling.
Extends multidimensional scaling to analyze three-way asymmetric proximities.
The present contribution suggests the use of a multidimensional scaling (MDS) algorithm as a visualization tool for manifold-valued elements. A visualization tool of this kind is useful in signal processing and machine learning whenever learning/adaptation algorithms insist on high-dimensional parameter manifolds.
A new method for aligning datasets without known correspondences.
We develop a new statistical test for comparing variables with varying scales.
Representational similarity analysis (RSA) has been shown to be an effective framework to characterize brain-activity profiles and deep neural network activations as representational geometry by computing the pairwise distances of the response patterns as a representational dissimilarity matrix (RDM). However, how to p…
Neuc-MDS extends MDS for non-Euclidean data.
Gaussian processes are typically used for smoothing and interpolation on small datasets. We introduce a new Bayesian nonparametric framework -- GPatt -- enabling automatic pattern extrapolation with Gaussian processes on large multidimensional datasets. GPatt unifies and extends highly expressive kernels and fast exact…
Paper proves MDS NP-hard and provides a PTAS.
Multidimensional scaling (MDS) is a class of projective algorithms traditionally used in Euclidean space to produce two- or three-dimensional visualizations of datasets of multidimensional points or point distances. More recently however, several authors have pointed out that for certain datasets, hyperbolic target spa…
This paper reviews MDS, Sammon mapping, and Isomap, explaining their theory and applications.
Bayesian hyperbolic MDS improves tree-like data representation.
Paper proposes conditional multidimensional scaling for better data reduction.
Exact Gaussian Process (GP) regression has O(N^3) runtime for data size N, making it intractable for large N. Many algorithms for improving GP scaling approximate the covariance with lower rank matrices. Other work has exploited structure inherent in particular covariance functions, including GPs with implied Markov st…
Finding the diameter of a dataset in multidimensional Euclidean space is a well-established problem, with well-known algorithms. However, most of the algorithms found in the literature do not scale well with large values of data dimension, so the time complexity grows exponentially in most cases, which makes these algo…
Large-scale and multidimensional spatiotemporal data sets are becoming ubiquitous in many real-world applications such as monitoring urban traffic and air quality. Making predictions on these time series has become a critical challenge due to not only the large-scale and high-dimensional nature but also the considerabl…
DPI quantifies phase differences in 1D and multidimensional signals using Riesz transform.
A new approach selects tuning parameters for embedding methods.
Bayesian Complementary Kernelized Learning models complex spatiotemporal data.
Paper analyzes multidimensional PIDEs for financial modeling, proving existence and uniqueness in Bessel spaces.
We present a scalable Gaussian process model for identifying and characterizing smooth multidimensional changepoints, and automatically learning changes in expressive covariance structure. We use Random Kitchen Sink features to flexibly define a change surface in combination with expressive spectral mixture kernels to …
Proposes a new model for simulating electricity prices and their correlation structure.
A new model captures multifractal volatility in stock returns.
New DR method uses Gromov-Wasserstein distance for high-dimensional data.
Extends Bayesian theory to handle complex interdependencies in multidimensional event spaces.
Continuous MDS embeds sequences of dissimilarities in Euclidean space.
In this work, a unified framework for gradient-free Multidimensional Scaling (MDS) based on Coordinate Search (CS) is proposed. This family of algorithms is an instance of General Pattern Search (GPS) methods which avoid the explicit computation of derivatives but instead evaluate the objective function while searching…
This paper improves MDS visualization by adjusting Wasserstein distances for heavy-tailed data.
A new model captures multifractal volatility in stock returns.
Extends specific relative entropy to multidimensional continuous martingales.
Infinite Tucker Decomposition (InfTucker) and random function prior models, as nonparametric Bayesian models on infinite exchangeable arrays, are more powerful models than widely-used multilinear factorization methods including Tucker and PARAFAC decomposition, (partly) due to their capability of modeling nonlinear rel…
The Empirical Mode Decomposition (EMD) provides a tool to characterize time series in terms of its implicit components oscillating at different time-scales. We apply this decomposition to intraday time series of the following three financial indices: the S\&P 500 (USA), the IPC (Mexico) and the VIX (volatility index US…
This paper deals with multidimensional dynamic risk measures induced by conditional -expectations. A notion of multidimensional -expectation is proposed to provide a multidimensional version of nonlinear expectations. By a technical result on explicit expressions for the comparison theorem, uniqueness theorem and…
The paper presents a machine learning approach to multidimensional item response theory.
Rough volatility is a well-established statistical stylised fact of financial assets. This property has lead to the design and analysis of various new rough stochastic volatility models. However, most of these developments have been carried out in the mono-asset case. In this work, we show that some specific multivaria…
Label embedding (LE) is an important family of multi-label classification algorithms that digest the label information jointly for better performance. Different real-world applications evaluate performance by different cost functions of interest. Current LE algorithms often aim to optimize one specific cost function, b…
A new clustering method improves recovery guarantees by re-embedding data.
The paper explores multidimensional critic output in GANs, improving convergence and diversity.
A method to visualize multidimensional local subspaces using implicit differentiation.
Neural network models of early sensory processing typically reduce the dimensionality of streaming input data. Such networks learn the principal subspace, in the sense of principal component analysis (PCA), by adjusting synaptic weights according to activity-dependent learning rules. When derived from a principled cost…
Recurrent neural networks (RNNs) have drawn interest from machine learning researchers because of their effectiveness at preserving past inputs for time-varying data processing tasks. To understand the success and limitations of RNNs, it is critical that we advance our analysis of their fundamental memory properties. W…
We prove optimal bounds for the convergence rate of ordinal embedding (also known as non-metric multidimensional scaling) in the 1-dimensional case. The examples witnessing optimality of our bounds arise from a result in additive number theory on sets of integers with no three-term arithmetic progressions. We also carr…
The class of Schoenberg transformations, embedding Euclidean distances into higher dimensional Euclidean spaces, is presented, and derived from theorems on positive definite and conditionally negative definite matrices. Original results on the arc lengths, angles and curvature of the transformations are proposed, and v…