Weiss and, independently, Mazzeo and Montcouquiol recently proved that a 3--dimensional hyperbolic cone-manifold (possibly with vertices) with all cone angles less than is infinitesimally rigid. On the other hand, Casson provided 1998 an example of an infinitesimally flexible cone-manifold with some of the cone an…
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
48 results for “flexible dimensionality”
Study shows non-existence of certain contact structures on odd-dimensional manifolds.
problem Existence of contact structures with flexible pages on odd-dimensional manifolds.
method Proved a topological obstruction and used symplectic actions to show non-existence.
result Non-existence of contact open books with flexible pages for certain manifolds.
Proposes flexible auto-encoders for varying data dimensions.
problem Fixed latent dimensions limit data flexibility.
method Stochastic bottleneck with weighted dropouts.
result Seamless variable dimensionality reduction with high performance.
Flexible links have symplectic representatives in complex projective space.
problem Existence of symplectic representatives for flexible links.
method Construction of a symplectic surface invariant under complex conjugation.
result No obstructions to finding symplectic representatives beyond classical topology.
Stabilized convex symplectic manifolds are equivalent to flexible Weinstein manifolds.
problem Understanding the equivalence between stabilized convex symplectic manifolds and flexible Weinstein manifolds.
method Analyzing the homotopy type and symplectic properties of the manifolds.
result Stabilized convex symplectic manifolds are symplectomorphic to flexible Weinstein manifolds.
New method finds smooth isometric immersions for low regularity metrics, achieving full flexibility.
problem Finding smooth isometric immersions for metrics with low Hölder regularity.
method Techniques of convex integration to find isometric immersions of low regularity.
result Achieves full flexibility, reaching for metrics.
We prove an analogue of Thurston's h-principle for -dimensional foliations on manifolds of dimension bigger or equal to , in the presence of a fiber-wise non-degenerate -form. This helps us understand the flexibility of rank regular Poisson structures on open manifolds with dimension bigger or equal to …
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.
Implicit Generative Copulasstat.ML
Flexible copula model using implicit generative neural networks.
problem Limited flexibility of parametric copulas and curse of dimensionality in non-parametric methods.
method Implicit generative neural networks to model high-dimensional copula distributions with unspecified marginals.
result Demonstrated flexibility and performance on various datasets.
Diffusion models adapt to low-dimensional data regardless of coefficient choices.
problem Understanding how diffusion models adapt to low-dimensional data structures.
method Analysis of diffusion models with flexible coefficient choices.
result Proven that iterations suffice for accurate sampling in total variation distance.
Anomaly detection is challenging, especially for large datasets in high dimensions. Here we explore a general anomaly detection framework based on dimensionality reduction and unsupervised clustering. We release DRAMA, a general python package that implements the general framework with a wide range of built-in options.…
Improves joint distribution learning for high-dimensional datasets with complex correlations.
problem Conditional independence assumption limitations in VAE decoders for high-dimensional datasets.
method Cramer-Wold distance regularization and two-step learning method for flexible prior modeling.
result Effective joint distributional learning for high-dimensional datasets with multiple categorical variables.
GNet uses Gaussian processes for scalable, flexible neural networks.
problem Large-scale predictive modeling with high computational and storage costs.
method GNet employs Gaussian processes with nonparametric activation functions and a fast algorithm for training and predictions.
result GNet achieves competitive performance across various test problems, including nonlinear function prediction and real-world data regression.
GNet uses Gaussian processes for scalable, flexible neural networks.
problem Large-scale predictive modeling with high computational and storage costs.
method GNet employs Gaussian processes with nonparametric activation functions and a fast algorithm for efficient training and predictions.
result GNet achieves competitive performance across various test problems, including nonlinear function prediction and real-world data regression.
Adapts score matching for missing data in flexible settings.
problem Learning data distribution with missing data.
method Adapted score matching to handle missing data, providing two approaches: importance weighting and variational.
result Variational approach performs best in high-dimensional settings.
We introduce the vine copula autoencoder (VCAE), a flexible generative model for high-dimensional distributions built in a straightforward three-step procedure. First, an autoencoder (AE) compresses the data into a lower dimensional representation. Second, the multivariate distribution of the encoded data is estimated …
Flexible VAEs using FIFs improve model likelihood on image datasets.
problem Limitations of diagonal Gaussian posteriors in VAEs.
method Regularized Free-form Injective Flow (FIF) for flexible posterior.
result Full covariance VAEs outperform diagonal Gaussian posteriors.
A new matrix factorization method for high-dimensional data.
problem Exploiting sparse structures in complex data for better interpretability.
method Bayesian shrinkage priors and flexible sparse patterns modeled through row and column dependencies.
result Demonstrated practical advantages through simulation and soccer heatmap analysis.
Proposes a flexible feature allocation model for sparse factor analysis.
problem Sparse data and rigid assumptions in traditional exploratory tools.
method Adaptive latent feature sharing with control over feature sparsity.
result Derives a novel adaptive Factor analysis (aFA) and aPPCA for flexible dimensionality reduction.
New method tackles high-dimensional contextual bandits with flexible kernel models.
problem Maximizing rewards in decision-making scenarios with many features.
method Introduces stochastic assumptions and no-regret learning for Gaussian kernels.
result Achieves no-regret learning even with feature dimensions growing with samples.
To model high dimensional data, Gaussian methods are widely used since they remain tractable and yield parsimonious models by imposing strong assumptions on the data. Vine copulas are more flexible by combining arbitrary marginal distributions and (conditional) bivariate copulas. Yet, this adaptability is accompanied b…
A fast method combines deep mixtures of sparse GPs for flexible modeling.
problem Flexible modeling with changing output densities.
method Designing gating network with DNN for selecting sparse GPs, using CCR algorithm.
result The method outperforms competing methods in accuracy and uncertainty quantification.
GPDFlow models extreme threshold exceedance with flexible dependence using normalizing flows.
problem Challenges in modeling multivariate threshold exceedance probabilities due to infinite parametrizations.
method GPDFlow uses normalizing flows to flexibly represent dependence without explicit parametric assumptions.
result GPDFlow significantly improves modeling accuracy and flexibility compared to traditional parametric methods.
We consider the problem of impulse response estimation of stable linear single-input single-output systems. It is a well-studied problem where flexible non-parametric models recently offered a leap in performance compared to the classical finite-dimensional model structures. Inspired by this development and the success…
Euclidean embeddings of data are fundamentally limited in their ability to capture latent semantic structures, which need not conform to Euclidean spatial assumptions. Here we consider an alternative, which embeds data as discrete probability distributions in a Wasserstein space, endowed with an optimal transport metri…
Centroid Decision Foreststat.ML
CDF uses centroids to split features for high-dimensional classification.
problem High-dimensional classification problems with complex class structures.
method CDF introduces a centroid-driven splitting strategy in decision trees.
result CDF outperforms conventional methods in high-dimensional classification.
Flexible Cox model for time-dependent covariates with complex sparsity patterns.
problem Lack of flexibility in enforcing specific sparsity patterns in time-dependent Cox models.
method Proposes a flexible framework for variable selection in time-dependent Cox models, accommodating complex selection rules.
result Achieves accurate estimation with low false alarm rates for complex covariate structures.
Paper offers a simpler solution for managing complex financial options.
problem Managing a large number of financial assets with diverse dynamics.
method Developed a simple analytical approximation for market making.
result Shows significant flexibility over existing market making strategies.
Flexible model captures varying scales in data clusters.
problem Real-world data often exhibits varying scales or intensities, violating the homogeneity assumption of classical Gaussian mixture models.
method Individual-heterogeneous sub-Gaussian mixture model with an efficient spectral method for exact recovery.
result The method provably achieves exact recovery of true cluster labels under mild separation conditions.
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…
We present a class of flexible and tractable static factor models for the term structure of joint default probabilities, the factor copula models. These high-dimensional models remain parsimonious with pair-copula constructions, and nest many standard models as special cases. The loss distribution of a portfolio of con…
Concept Factorization (CF) and its variants may produce inaccurate representation and clustering results due to the sensitivity to noise, hard constraint on the reconstruction error and pre-obtained approximate similarities. To improve the representation ability, a novel unsupervised Robust Flexible Auto-weighted Local…
Crocheting Mathematicsmath.HO
Crochet creates precise 2D shapes from 1D material.
problem Creating precise 2D shapes from 1D material.
method Using crochet to generate constant flat, spherical, or hyperbolic shapes.
result Crochet is the most flexible and precise method for building dynamical systems with high curvature precision.
Flexible model tackles high-dimensional, missing data, and stochastic processes.
problem High-dimensional longitudinal data with structured missingness and unknown measurement time points.
method Latent variable model using Gaussian processes and variational autoencoder.
result Competitive performance on simulated and real datasets.
New algorithm finds best subset in high-dimensional data models.
problem Finding the best subset of predictors in high-dimensional data models.
method Proposes a scalable algorithm using a generalized information criterion.
result Directly proves consistency and oracle property for the best-subset selection.
Enhancing spectral embedding for low-dimensional embeddings in rare disease cohorts
problem Representing clinical concepts and patients in electronic health records
method Spectral-based unsupervised learning with flexible knowledge transfer
result Outperforms competing approaches in challenging scenarios
Training Gaussian process-based models typically involves an computational bottleneck due to inverting the covariance matrix. Popular methods for overcoming this matrix inversion problem cannot adequately model all types of latent functions, and are often not parallelizable. However, judicious choice of model…
Develops TOFU for tensor bandits with low-rank structure.
problem Linear bandit models fail to capture high-dimensional, low-rank tensor structures.
method Develops TOFU, a tensor bandit algorithm that estimates low-dimensional subspaces and uses norm constraints.
result Improves regret bound by a multiplicative factor that grows exponentially in system order.
Flexible co-data learning improves clinical prediction models.
problem High-dimensional clinical data challenges prediction accuracy.
method Combining domain knowledge and external studies to estimate adaptive multi-group ridge penalties.
result Improves prediction performance and variable selection stability.
Diffusion models enhance SBI with flexible parameter and observation learning.
problem Efficient and accurate estimation of latent parameters from simulations and real data.
method Score-based diffusion models, guidance, score composition, flow matching, consistency models, joint modeling.
result Flexibility and versatility in modeling various problems.
Classification is an important topic in statistics and machine learning with great potential in many real applications. In this paper, we investigate two popular large margin classification methods, Support Vector Machine (SVM) and Distance Weighted Discrimination (DWD), under two contexts: the high-dimensional, low-sa…
Introduces BPEL for EL, enhancing flexibility and using MCMC for inference.
problem Computational challenges in EL methods.
method Bayesian Penalized Empirical Likelihood (BPEL) framework with MCMC sampling.
result Enhanced flexibility and practicality of EL methods with MCMC.
In this paper we define and study flexible links and flexible isotopy in projective space. Flexible links are meant to capture the topological properties of real algebraic links. We classify all flexible links up to flexible isotopy using Ekholms interpretation of Viros encomplexed writhe.
The authors characterize flexibility in power and energy markets considering time, spatiality, resource, and risk.
problem Evaluating and maximizing flexibility in power systems and markets.
method Characterization of flexibility dimensions (time, spatiality, resource, risk) and their interrelations with flexibility assets, products, and services.
result Flexibility should be evaluated based on multiple dimensions for efficient power systems and markets.
The paper tackles model collapse in GPLVMs by improving kernel flexibility and projection variance.
problem Model collapse in GPLVMs leading to vague latent representations.
method Theoretical analysis of projection variance, integration of SM and RFF kernels, and variational inference.
result The advisedRFLVM outperforms competing models in informative latent representations and missing data imputation.
Study models weather index insurance pricing by insurers and farmers, finding flexible pricing kernels boost profits.
problem Monopoly pricing of weather index insurance with risk and flexibility considerations.
method Bowley-type sequential game with insurer and farmer, using neural networks for farmer's payoff.
result Flexible pricing kernels increase insurer profits closer to indemnity insurance levels.
Bayesian approach controls FDR in high-dimensional models.
problem High-dimensional variable selection and inference.
method Adapted Mirror Statistic to Bayesian framework for FDR control.
result Effective FDR control without data splitting.
Simplifies IV regression for high-dimensional instruments.
problem Nonlinear instrumental variable regression with high-dimensional instruments.
method Combines kernelized IV methods with an adaptive regression algorithm.
result Faster convergence and adaptability to feature dimensionality.