Generative model handles varying data dimensions using jump diffusion processes.
problem Handling data of varying dimensionality in generative models.
method Formulated as a jump diffusion process, learning to approximate the process with a novel evidence lower bound.
result Effective sampling of data of varying dimensionality, better compatibility with test-time diffusion guidance imputation tasks.
Study shows that ridgeless Gaussian kernel regression overfits even with varying bandwidth or dimensionality.
problem Analyzing overfitting in Gaussian kernel ridgeless regression with varying bandwidth or dimensionality.
method Examined the behavior of minimum norm interpolating solutions for fixed and increasing dimensions under varying bandwidth and sample size.
result Ridgeless solutions are never consistent and can be worse than null predictor with large enough noise, even with varying bandwidth or dimensionality.
Adaptive ML learns complex time-varying systems without new data.
problem Applying ML to time-varying systems with shifting distributions.
method Mapping high-dimensional inputs to low-dimensional latent space, actively tuning latent space based on feedback.
result Learning correlations and tracking system evolution in real-time without new data.
PSMF factorizes time-varying datasets into a dictionary and time-varying coefficients.
problem Factorizing time-varying and non-stationary datasets with temporal nonlinearities.
method Probabilistic Sequential Matrix Factorization (PSMF) using nonlinear Gaussian state-space models and approximate extended Kalman filtering.
result PSMF can account for temporal nonlinearities and estimate generic subspace models.
Proposes a method for interpreting time-varying causal effect moderation in high-dimensional data.
problem Interpreting causal effect moderation in high-dimensional data with interpretability and avoiding false positives.
method Two-step method: 1) Selects a smaller model for linear causal effect moderation using Gaussian randomization, 2) Conditions on selection to construct a pivot for uniformly asymptotic semi-parametric inference.
result Consistently achieves valid coverage rates and shorter, bounded intervals in time-varying causal effect moderation.
AJL framework detects dynamic patterns in high-dimensional time-varying models.
problem Complex time-varying associations and abrupt regime shifts in longitudinal processes.
method Hierarchical regularization framework integrating functional variable selection with structural changepoint detection.
result The refined estimator achieves the oracle property in ultra-high-dimensional settings.
Paper efficiently infers differential parameters in time-varying models using time score matching.
problem Efficiently inferring differential parameters in time-varying probabilistic models.
method Directly estimates the differential parameter using time score matching and proves consistency of the method.
result Consistent estimation of parameter derivatives in high-dimensional settings.
A new method generates counterfactual treatment outcomes for time-varying treatments.
problem Estimating counterfactual outcomes for time-varying treatments with high-dimensional outcomes.
method Conditional generative framework with inverse probability re-weighting.
result Our method outperforms state-of-the-art baselines in generating high-quality counterfactual samples.
Very few K-nearest-neighbor (KNN) ensembles exist, despite the efficacy of this approach in regression, classification, and outlier detection. Those that do exist focus on bagging features, rather than varying k or bagging observations; it is unknown whether varying k or bagging observations can improve prediction. Giv…
We consider a curve of Fredholm pairs of Lagrangian subspaces in a fixed Banach space with continuously varying (weak) symplectic structures. Assuming vanishing index, we obtain intrinsically a continuously varying splitting of the total Banach space into pairs of symplectic subspaces. Using such decompositions we defi…
Quantum computers can speed up machine learning optimization problems.
problem Long computation times and high resource requirements for classical optimization algorithms in machine learning.
method Developed a mathematical model to leverage quantum parallelism for machine learning.
result Quantum machine learning applied to a 3D time-varying image demonstrated significant speedup.
Paper proposes efficient methods for forecasting with large datasets.
problem Forecasting with large, high-dimensional economic data sets.
method Bayesian hierarchical priors, factor graphs, message passing algorithms, Generalized Approximate Message Passing (GAMP).
result The proposed methods outperform traditional approaches in forecasting U.S. price inflation.
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.
A new method for solving complex inverse problems using deep learning.
problem Estimating complex spatially-varying parameters in high-dimensional Bayesian inverse problems.
method A variational inference method with a deep generative prior to approximate the posterior distribution.
result The method improves estimation accuracy and efficiency for solving high-dimensional inverse problems.
We propose a novel class of time-varying nonparanormal graphical models, which allows us to model high dimensional heavy-tailed systems and the evolution of their latent network structures. Under this model, we develop statistical tests for presence of edges both locally at a fixed index value and globally over a range…
Correlations between asset returns are important in many financial applications. In recent years, multivariate volatility models have been used to describe the time-varying feature of the correlations. However, the curse of dimensionality quickly becomes an issue as the number of correlations is k(k−1)/2 for k asse…
This paper describes a novel approach to change-point detection when the observed high-dimensional data may have missing elements. The performance of classical methods for change-point detection typically scales poorly with the dimensionality of the data, so that a large number of observations are collected after the t…
A scalable model for high-dimensional longitudinal data.
problem Modeling high-dimensional, non-linear, time-varying longitudinal data.
method LMM-VAE, combining linear mixed models and amortized variational inference.
result Competitive performance across simulated and real-world datasets.
QSurv models survival data without discretization, achieving high accuracy.
problem Intractable likelihood estimation for continuous-time survival models.
method QSurv uses numerical quadrature for cumulative hazard approximation and time-conditioned low-rank adaptation.
result QSurv achieves competitive predictive performance and interpretable hazard patterns.
Proposes L-VAE for longitudinal data analysis.
problem Analyse high-dimensional longitudinal data with missing values.
method Uses a multi-output additive Gaussian process (GP) prior to extend VAE's capability.
result Achieves highly accurate predictive performance.
BASS efficiently learns time-varying graphs with low complexity and automatic tuning.
problem Estimating time-varying graphical models with efficient and automatic parameter tuning.
method BASS uses temporally-dependent spike-and-slab priors and variational inference to learn graph structures efficiently.
result BASS outperforms existing methods in recovering true graphs, especially for high-dimensional cases.
When applying principal component analysis (PCA) for dimension reduction, the most varying projections are usually used in order to retain most of the information. For the purpose of anomaly and change detection, however, the least varying projections are often the most important ones. In this article, we present a nov…
Balanced Neural ODEs combine VAEs and Neural ODEs for efficient time series modeling.
problem Efficiently modeling systems with time-varying inputs and varying complexity.
method Combines VAEs for dimensionality reduction and Neural ODEs for dynamics, using variational parameters to adaptively learn.
result Balanced Neural ODEs (B-NODE) efficiently approximate Koopman operator without predefined dimensionality.
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.
One of the cornerstones of the field of signal processing on graphs are graph filters, direct analogues of classical filters, but intended for signals defined on graphs. This work brings forth new insights on the distributed graph filtering problem. We design a family of autoregressive moving average (ARMA) recursions,…
Paper classifies special slant surfaces with varying curvature.
problem Classifying surfaces with non-constant mean curvature.
method Analyzing special slant surfaces in complex space forms.
result Complete classification of surfaces with non-constant mean curvature.
Estimates the effect of time-varying treatments using machine learning.
problem Estimating the impact of time-varying treatments over multiple periods.
method Difference-in-Differences framework with double/debiased machine learning.
result Higher vaccination rates reduce COVID-19 mortality after several weeks.
We study the parameter estimation problem for a varying index coefficient model in high dimensions. Unlike the most existing works that iteratively estimate the parameters and link functions, based on the generalized Stein's identity, we propose computationally efficient estimators for the high-dimensional parameters w…
A fundamental object in a hyperbolic 3-manifold M is its convex core C(M), defined as the smallest closed non-empty convex subset of M. We investigate the way the geometry of the boundary S of C(M) varies as we vary the hyperbolic metric of M. Thurston observed that the intrinsic metric of S is hyperbolic, and that its…
Proposes a method to forecast dependencies between thousands of time series.
problem Computational and numerical difficulties in estimating high-dimensional covariance matrices.
method Combines RNN and Gaussian copula process with low-rank covariance structure.
result Significant accuracy improvements over state-of-the-art baselines.
A generalization of expectiles for d-dimensional multivariate distribution functions is introduced. The resulting geometric expectiles are unique solutions to a convex risk minimization problem and are given by d-dimensional vectors. They are well behaved under common data transformations and the corresponding sample v…
We address the curse of dimensionality in dynamic covariance estimation by modeling the underlying co-volatility dynamics of a time series vector through latent time-varying stochastic factors. The use of a global-local shrinkage prior for the elements of the factor loadings matrix pulls loadings on superfluous factors…
We simplify Bayesian filtering by framing it as optimization, making it practical for high-dimensional systems.
problem Bayesian filtering struggles in high-dimensional state spaces like neural networks.
method We frame Bayesian filtering as optimization, using gradient descent for nonlinear cases.
result Our method results in effective, robust, and scalable filters for high-dimensional systems.
Efficiently infers time-varying sparse MRFs with strong statistical guarantees.
problem Inference of time-varying sparse MRFs with strong statistical guarantees.
method Constrained optimization with exact ℓ0 regularization, near-linear time and memory complexity. result Sharp statistical guarantees for sparsely-changing Gaussian MRFs with as few as one sample per time.
In this paper, we introduce the notion of liquid time-constant (LTC) recurrent neural networks (RNN)s, a subclass of continuous-time RNNs, with varying neuronal time-constant realized by their nonlinear synaptic transmission model. This feature is inspired by the communication principles in the nervous system of small …
We present a windowed technique to learn parsimonious time-varying autoregressive models from multivariate timeseries. This unsupervised method uncovers interpretable spatiotemporal structure in data via non-smooth and non-convex optimization. In each time window, we assume the data follow a linear model parameterized …
Paper studies efficient function approximation in high-dimensional spaces with low-dimensional structures.
problem Regression of functions varying along a central subspace in high-dimensional spaces.
method Generalized Contour Regression (GCR) algorithm for estimating the central subspace using piecewise polynomials.
result GCR leads to a mean squared estimation error of O(n−1) for the central subspace, improving the mean squared regression error of f to $O(n^{- rac{2s}{2s+d}})$. We consider the problem of varying conformally the metric of a four dimensional manifold in order to obtain constant Q-curvature. The problem is variational, and solutions are in general found as critical points of saddle type. We show how the problem leads naturally to consider the set of formal barycenters of the m…
The paper tackles financial market dynamics with new tech-driven data.
problem High-dimensional, high-correlation, and time-varying financial data.
method Developing adaptive multi-factor models and techniques to handle data complexities.
result Improved interpretability, clearer explanations, and better predictions.
We formulate and analyze a graphical model selection method for inferring the conditional independence graph of a high-dimensional nonstationary Gaussian random process (time series) from a finite-length observation. The observed process samples are assumed uncorrelated over time and having a time-varying marginal dist…
KAPLAN-HR models survival data without manual interactions, outperforming existing methods.
problem Survival analysis challenges with complex covariates and time-varying effects.
method Kolmogorov-Arnold Networks (KAN) for nonparametric hazard estimation.
result KAPLAN-HR matches or exceeds existing methods in clinical survival data.
A new method estimates time-varying parameters in earth system models using offline and online data assimilation.
problem Estimating time-varying parameters in complex earth system models.
method Hybrid Offline Online Parameter Estimation with Particle Filtering (HOOPE-PF)
result HOOPE-PF outperforms existing methods, especially with small ensemble sizes.
Study shows double descent curve in high-dimensional linear regression with random projections.
problem Understanding the generalization performance in high-dimensional settings with random projections.
method Fixed prediction problem, ridge regression estimator, minimum norm least-squares fit, random matrix theory, asymptotic equivalents.
result Exhibit a double descent curve for high-dimensional linear regression with random projections.
Given any nondegenerate k-dimensional minimal submanifold K of codimension greater than 1, we prove the existence of families of constant mean curvature submanifolds, with mean curvature varying from one member of the family to another, which `condense' to K. In particular, our result proves the existence of constant m…
New framework models non-conservative stochastic processes without energy conservation constraints.
problem Existing Schrödinger Bridge methods are limited by energy-conservation assumptions.
method Introduces non-conservative generalized Schrödinger bridge (NCGSB) based on contact Hamiltonian mechanics.
result Contact Wasserstein geodesic (CWG) provides a broader class of real-world stochastic processes.
5D SCFTs can have confining vacua with strings and unbroken symmetries.
problem Investigating phases of 5D SCFTs by varying couplings.
method Using geometric realisation of M-theory on metrically conical Calabi-Yau threefolds.
result Many 5D SCFTs have couplings leading to massive, confining vacua with strings and unbroken symmetries.
Local EGOP learns functions varying along a few directions.
problem Efficient estimation of functions varying along a few directions in high-dimensional space.
method Local EGOP learning, a recursive algorithm using EGOP quadratic form as metric and inverse-covariance.
result Local EGOP learning achieves intrinsic dimensional learning rates under noisy manifold hypothesis.
Study shows how certain curved bundles reduce their structure group.
problem Understanding how curvature affects bundle structure.
method Analyzes bundles with fibers as real projective spaces and positive curvature metrics.
result Structure group of bundles reduces when fibers have specific curvature properties.