Paper introduces methods to handle missing data in probabilistic regression trees.
problem Handling missing data in probabilistic regression trees.
method Three approaches: uniform probability, partial observation, and dimension-reduced smoothing.
result Preserves interpretability while extending applicability to incomplete datasets.
Study 4D steady gradient Ricci solitons reducing to 3D manifolds.
problem Understanding 4D steady gradient Ricci solitons that reduce to 3D.
method Analyzing asymptotic geometry and curvature properties.
result 4D solitons either reduce to spherical space forms or the 3D Bryant soliton.
HyperCR Einstein--Weyl equations in 2+1 dimensions reduce to a pair of quasi-linear PDEs of hydrodynamic type. All solutions to this hydrodynamic system can be in principle constructed from a twistor correspondence, thus establishing the integrability. Simple examples of solutions including the hydrodynamic reductions …
Paper introduces a new method for efficient portfolio risk quantification.
problem Efficiently quantify risk in large portfolios with many trades and few dominant risk factors.
method Combines Fourier-cosine series with tensor decomposition techniques for dimension reduction.
result Achieves relative errors below 0.1% with significant runtime improvement.
A new method reduces dimensionality for better likelihood-free parameter estimation.
problem Estimating parameters from data with no closed-form likelihood.
method Combines reconstruction map estimation with dimension-reduction techniques.
result The proposed method outperforms existing techniques in accuracy and efficiency.
Motivated by the idea of turbomachinery active subspace performance maps, this paper studies dimension reduction in turbomachinery 3D CFD simulations. First, we show that these subspaces exist across different blades---under the same parametrization---largely independent of their Mach number or Reynolds number. This is…
Improved uniform convergence bound with fat-shattering dimension reduces sample complexity gap.
problem Gap between upper and lower bounds on sample complexity for fat-shattering dimension.
method Provided an improved uniform convergence bound.
result Closed the gap between existing upper and lower bounds on sample complexity.
A new method maps high-dimensional Bayesian inverse problems to lower dimensions.
problem High-dimensional Bayesian inverse problems with complex prior information.
method Data-driven VAE prior and KRnet map for posterior approximation in latent space.
result Efficiently reduces computational cost and approximates posterior distributions.
We study the necessary and sufficient complexity of ReLU neural networks---in terms of depth and number of weights---which is required for approximating classifier functions in L2. As a model class, we consider the set Eβ(Rd) of possibly discontinuous piecewise Cβ functions $f : [-1/2, 1/2]^…
A new layer, funnel, reduces dimensionality in flows for better performance.
problem Training high-dimensional models efficiently and accurately.
method Constructing dimension-reducing surjective flows using the funnel layer.
result The funnel layer improves model performance with a smaller latent space.
Symbolic LSTM improves time series forecasting by reducing hyperparameter sensitivity.
problem High sensitivity to hyperparameters and random initialization in numerical time series forecasting.
method Combining LSTM with a dimension-reducing symbolic representation.
result Symbolic representation alleviates forecasting problems and speeds up training.
This research shows that steady solitons in higher dimensions always reduce at infinity.
problem Characterizing steady solitons with nonnegative sectional curvature in higher dimensions.
method Dimension reduction analysis and tangent flow classification.
result Steady solitons in higher dimensions always reduce at infinity.
This article reviews and compares various methods for estimating conditional distributions.
problem Inference of conditional distributions in statistics.
method Classical nonparametric methods and modern generative models.
result A systematic numerical comparison of methods using performance metrics.
Efficiently learns 3D convolutions with less data.
problem High parameter and data costs in 3D convolutions.
method Temporal factorization of 3D kernels.
result Significantly reduces training data requirement and parameter count.
Study expanding Ricci solitons on vector bundles, reducing to Higgs bundle equations.
problem Understanding the long-time behavior of Ricci flows on manifolds.
method Prove equations dimension-reduce to twisted harmonic-Einstein equations, establish correspondence with G-Higgs bundles.
result Produce infinite families of new non-locally homogeneous examples, complete description in dimension 4.
Paper calculates the exact error of LDA models.
problem Bayesian generalization error in Latent Dirichlet Allocation (LDA).
method Theoretical analysis of learning coefficient using algebraic geometry.
result Exact asymptotic form of LDA's generalization error.
Molecular simulations produce very high-dimensional data-sets with millions of data points. As analysis methods are often unable to cope with so many dimensions, it is common to use dimensionality reduction and clustering methods to reach a reduced representation of the data. Yet these methods often fail to capture the…
There is an increasing demand for computing the relevant structures, equilibria and long-timescale kinetics of biomolecular processes, such as protein-drug binding, from high-throughput molecular dynamics simulations. Current methods employ transformation of simulated coordinates into structural features, dimension red…
New method reconstructs Black-Scholes option prices from current profiles.
problem Reconstructing Black-Scholes prices from current profiles, dealing with ill-posedness.
method Price-dimensional reduction using Legendre polynomials, Tikhonov regularization.
result Reconstructs Black-Scholes prices from noisy initial data, stabilizing the solution.
A neural network derived from first principles using MaxEnt.
problem Developing a neural network from first principles.
method Derived a neural network using the principle of Maximum Entropy, with linear dimension-reducing transformations and conditional mean estimators.
result Unified theoretical justification for activation functions like sigmoid, softplus, and relu.
Microarray cancer gene expression data comprise of very high dimensions. Reducing the dimensions helps in improving the overall analysis and classification performance. We propose two hybrid techniques, Biogeography - based Optimization - Random Forests (BBO - RF) and BBO - SVM (Support Vector Machines) with gene ranki…
The presence of a sparse "truth" has been a constant assumption in the theoretical analysis of sparse PCA and is often implicit in its methodological development. This naturally raises questions about the properties of sparse PCA methods and how they depend on the assumption of sparsity. Under what conditions can the r…
The local linear embedding algorithm (LLE) is a non-linear dimension-reducing technique, widely used due to its computational simplicity and intuitive approach. LLE first linearly reconstructs each input point from its nearest neighbors and then preserves these neighborhood relations in the low-dimensional embedding. W…
Proposes a method to estimate personalized treatments from high-dimensional data.
problem Estimating individualized treatment regimes (ITRs) from high-dimensional covariates.
method Directly targets the contrast between potential outcomes, using dimension-reduced outcome-weighted learning.
result Achieves universal consistency, converging to the Bayes risk under mild conditions.
A new method uses matrix sketches for efficient graph clustering in dynamic environments.
problem Efficiently clustering large, dynamic graphs in distributed memory systems.
method Inspired by spectral clustering, the approach uses random dimension-reducing projections to derive matrix sketches.
result The method produces embeddings that yield performant clustering results in a fully-dynamic stochastic block model stream.
New algorithm reduces rank constrained optimization problems.
problem Rank constrained optimization problems in machine learning and statistics.
method Recursive Importance Sketching (RISRO) algorithm.
result RISRO offers clear advantages over existing algorithms and converges efficiently.
A new tree-based model for multivariate responses interprets piecewise linear regimes.
problem Recovering piecewise multivariate linear regimes in complex data.
method Twoblock clustering trees with coskewness-based dimension reduction.
result Recovery of piecewise linear regimes in data.
CIR method preserves relation for case-control studies.
problem Learning low-dimensional structure in case-control studies.
method Contrastive inverse regression (CIR) on Stiefel manifold.
result CIR outperforms other methods for high-dimensional data.
The paper develops personalized DAG models for web user behavior.
problem Understanding user behavior transitions between websites with user heterogeneity and network dependency.
method Personalized Binomial DAG models with network-structured covariates, embedding network structure into a dimension-reduced covariate, learning node neighborhoods, and exploring variance-mean relation.
result The proposed algorithm outperforms state-of-the-art competitors in heterogeneous data.
New method for imputing missing data in multi-view data.
problem Large missing data sets in multi-view data.
method Stacked penalized logistic regression (StaPLR) in a dimension-reduced space.
result New method performs competitively with lower computational cost.
The paper introduces a method for forecasting corporate sales growth using multiple reference variables.
problem Forecasting corporate sales growth with multiple reference variables.
method Reference class selection using rank-based algorithms and principal components analysis for data dimension reduction.
result Dimension reduced variables with past sales growth rates and operating margins perform well in forecasting.
Study uses neural nets to learn multi-index models in high dimensions, reducing complexity.
problem Learning multi-index models in high-dimensional data.
method Mean-field Langevin dynamics with neural networks.
result Effective dimension controls sample and computational complexity, potentially reducing it.
New algorithm speeds up Bayesian UQ for high-dimensional inverse problems.
problem Computational inefficiency in Bayesian inference for high-dimensional inverse problems.
method Deep neural network-based autoencoder for dimension reduction and emulation phase.
result Computational efficiency up to three orders of magnitude with scalable Bayesian UQ.
Generative AI improves surrogate models by blending LF and HF data.
problem Data scarcity between high-fidelity and low-fidelity simulations.
method Probabilistic multi-fidelity surrogate framework using generative transfer learning.
result The model achieves HF accuracy with fewer HF evaluations.
Proposes a tool to contrast global vs personalized models in clinical prediction.
problem Balancing global vs personalized models in clinical prediction.
method Localized regression approach using autoencoder for dimension reduction.
result Identification of patient subgroups where global models fall short.
WSINDy identifies reduced Hamiltonian systems from particle interactions.
problem Coarse-graining Hamiltonian dynamics with approximate symmetries.
method WSINDy algorithm applied to Hamiltonian systems with timescale separation.
result WSINDy successfully identifies reduced Hamiltonian systems from noisy data.
New method achieves superlinear convergence rate with limited memory.
problem Achieving superlinear convergence rate in quasi-Newton methods with limited memory.
method Limited-memory Greedy BFGS (LG-BFGS) method with displacement aggregation and basis vector selection.
result Explicit non-asymptotic superlinear convergence rate demonstrated.
Abstract reviews geometric theories of smooth and F-smooth systems.
problem Geometric theories of smooth and F-smooth systems.
method Reviews geometric theories of smooth and F-smooth systems.
result Discusses geometric theories of smooth and F-smooth systems.
Smoothly embed 3-manifolds in 5-manifolds, simplifying topological to smooth.
problem Embedding 3-manifolds smoothly in 5-manifolds.
method Homotopy and small homotopy to achieve smooth embeddings.
result Locally flat embeddings are homotopic to smooth ones.
Smooth families of biholomorphisms between strongly pseudoconvex domains are shown to be smooth.
problem Smoothness of families of biholomorphisms between strongly pseudoconvex domains.
method Riemannian geometry of Bergman metrics and smoothness of families of isometries.
result Smoothness of families of biholomorphisms between strongly pseudoconvex domains.
We prove that smooth cube manifolds have normal smooth structures.
Smooth submetries between curved spaces are smooth.
problem Smoothness of submetries between curved spaces.
method Proving smoothness of submetries in a general setting, including Riemannian submersions and isometric actions.
result Smoothness of the base manifold is implied by the smoothness of the total manifold without curvature assumptions.
On a compact, oriented, Riemannian manifold, the Hodge decomposition theorem associates a smooth primitive to any exact smooth form omega. In this paper, we show that given a smooth family of exact smooth forms omega(t), the family of associated primitives is also a smooth family with respect to t.
Proves linear extension of isometries in smooth 2D Banach spaces.
problem Linear extension of isometries in absolutely smooth 2D Banach spaces.
method Analyzes isometries between unit spheres of smooth Banach spaces.
result Any isometry extends to a linear isometry of Banach spaces.
Estimates time-varying network connections using multi-stage smoothing.
problem Estimating edge probabilities of time-varying networks.
method Multi-stage smoothing: temporal local smoothing followed by node-domain smoothing.
result Captures both smooth temporal evolution and structural patterns in connectivity.
The paper constructs infinitely many G-smoothings of a G-manifold.
problem Constructing G-smoothings of a G-manifold. method Using controlled h-cobordisms. result Infinitely many G-smoothings of a G-manifold are constructed and are isotopic after taking a product with R. Investigates smoothness of specific algebra structures.
problem Smoothness of bi-quadratic algebras on three generators.
method Analyzes differential smoothness with PBW basis.
result Characterizes conditions for smoothness.
New smoothing techniques for topological surfaces in 4-manifolds.
problem Topological isotopy of surfaces in smooth 4-manifolds.
method Combining Quinn's smoothing theory with Gabai's light bulb theorem and other developments.
result Proves topological = smooth results for certain disks and spheres.