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.
Proposes PredVAR model for reduced-dimensional dynamics from noisy data.
We examine doing probabilistic descent over manifolds implicitly defined by a set of polynomials with rational coefficients. The system of polynomials is assumed to be triangularized. An application of Whitney's embedding theorem allows us to work in a reduced dimensional embedding space. A numerical continuation metho…
New PCA method for derivatives problems.
Researchers develop methods to reduce simulation costs for cardiovascular modeling.
A new layer, funnel, reduces dimensionality in flows for better performance.
Method discovers symmetries in data with neural networks.
FL-Sailer enables federated learning for scATAC-seq data, reducing dimensionality and noise.
The problem of convex optimization is studied. Usually in convex optimization the minimization is over a d-dimensional domain. Very often the convergence rate of an optimization algorithm depends on the dimension d. The algorithms studied in this paper utilize dictionaries instead of a canonical basis used in the coord…
Complexity is an interdisciplinary concept which, first of all, addresses the question of how order emerges out of randomness. For many reasons matrices provide a very practical and powerful tool in approaching and quantifying the related characteristics. Based on several natural complex dynamical systems, like the str…
Symmetric binary matrices representing relations among entities are commonly collected in many areas. Our focus is on dynamically evolving binary relational matrices, with interest being in inference on the relationship structure and prediction. We propose a nonparametric Bayesian dynamic model, which reduces dimension…
Meta-learning bandits by reducing dimensionality with PCA.
A variable screening procedure via correlation learning was proposed Fan and Lv (2008) to reduce dimensionality in sparse ultra-high dimensional models. Even when the true model is linear, the marginal regression can be highly nonlinear. To address this issue, we further extend the correlation learning to marginal nonp…
Paper reduces dimensionality for robust option pricing in 2-asset markets.
The problem of finding a reduced dimensionality representation of categorical variables while preserving their most relevant characteristics is fundamental for the analysis of complex data. Specifically, given a co-occurrence matrix of two variables, one often seeks a compact representation of one variable which preser…
Improves Group Lasso for categorical data by reducing dimensionality and selecting models.
Random projections (RP) are a popular tool for reducing dimensionality while preserving local geometry. In many applications the data set to be projected is given to us in advance, yet the current RP techniques do not make use of information about the data. In this paper, we provide a computationally light way to extra…
DBPA assesses LLM perturbations using frequentist hypothesis testing.
This paper proposes a probabilistic neural network developed on the basis of time-series discriminant component analysis (TSDCA) that can be used to classify high-dimensional time-series patterns. TSDCA involves the compression of high-dimensional time series into a lower-dimensional space using a set of orthogonal tra…
A method for high-dimensional Bayesian optimization reduces dimensionality using EDR and Gaussian process.
GD-VAEs learn dynamics from observations using geometric and topological information.
A new method reduces dimensionality for better likelihood-free parameter estimation.
EBM reduces dimensionality for estimating heterogeneous CATEs.
The learning of mixture models can be viewed as a clustering problem. Indeed, given data samples independently generated from a mixture of distributions, we often would like to find the {\it correct target clustering} of the samples according to which component distribution they were generated from. For a clustering pr…
In this work, we develop a novel principal component analysis (PCA) for semimartingales by introducing a suitable spectral analysis for the quadratic variation operator. Motivated by high-dimensional complex systems typically found in interest rate markets, we investigate correlation in high-dimensional high-frequency …
Faced with distribution shift between training and test set, we wish to detect and quantify the shift, and to correct our classifiers without test set labels. Motivated by medical diagnosis, where diseases (targets) cause symptoms (observations), we focus on label shift, where the label marginal changes but the …
Method learns molecular Hamiltonian for accurate electron dynamics predictions.
PCA-Guided Quantile Sampling preserves data structure in large datasets.
ISOKANN learns collective variables and effective dynamics for metastable transitions.
New algorithm reduces dimensionality in federated learning.
A new theory explains large associative memory with biological plausibility.
Paper introduces MGLasso for multiscale graph inference in clustering and network analysis.
Study on reducing dimensionality in high-dimensional regression with kernel methods and stability analysis.
Balanced Neural ODEs combine VAEs and Neural ODEs for efficient time series modeling.
New method reduces high-dimensional data to key features.
We simplify Volterra process predictions by reducing dimensionality and using a tailored deep learning model.
ISVAE enhances interpretability in time series clustering using a novel filter bank.
A new path development layer reduces dimensionality for irregular time series.
Hyperbolic embeddings offer excellent quality with few dimensions when embedding hierarchical data structures like synonym or type hierarchies. Given a tree, we give a combinatorial construction that embeds the tree in hyperbolic space with arbitrarily low distortion without using optimization. On WordNet, our combinat…
Unsupervised dimension selection is an important problem that seeks to reduce dimensionality of data, while preserving the most useful characteristics. While dimensionality reduction is commonly utilized to construct low-dimensional embeddings, they produce feature spaces that are hard to interpret. Further, in applica…
Currently, approximately 30% of epileptic patients treated with antiepileptic drugs (AEDs) remain resistant to treatment (known as refractory patients). This project seeks to understand the underlying similarities in refractory patients vs. other epileptic patients, identify features contributing to drug resistance acr…
This paper simplifies finding least favorable priors by reducing dimensionality.
Two methods preserve tensor structure for reduced dimensionality in tensor regression.
AEGR method improves anomaly detection in autoencoders without needing anomaly-free training data.
Finding the reduced-dimensional structure is critical to understanding complex networks. Existing approaches such as spectral clustering are applicable only when the full network is explicitly observed. In this paper, we focus on the online factorization and partition of implicit large-scale networks based on observati…
New algorithm reduces dimensionality in stochastic optimization.
The classification of shapes is of great interest in diverse areas ranging from medical imaging to computer vision and beyond. While many statistical frameworks have been developed for the classification problem, most are strongly tied to early formulations of the problem - with an object to be classified described as …
Change detection in multivariate time series has applications in many domains, including health care and network monitoring. A common approach to detect changes is to compare the divergence between the distributions of a reference window and a test window. When the number of dimensions is very large, however, the naive…
Traffic signal control has long been considered as a critical topic in intelligent transportation systems. Most existing learning methods mainly focus on isolated intersections and suffer from inefficient training. This paper aims at the cooperative control for large scale multi-intersection traffic signal, in which a …