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…
A new method for aligning datasets without known correspondences.
problem Aligning datasets from different domains without labeled correspondences.
method Integrates MDS and Wasserstein Procrustes for joint optimization of embeddings and correspondences.
result Maps datasets to a common low-dimensional space without labeled correspondences.
Quaternion neural networks improve speech recognition efficiency.
problem Improving speech recognition systems with fewer parameters.
method Investigating quaternion-valued convolutional and recurrent neural networks.
result Quaternion neural networks outperform real-valued models with fewer parameters.
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…
Neuc-MDS extends MDS for non-Euclidean data.
problem Limitations of classical MDS with non-Euclidean data.
method Generalizes inner product to symmetric bilinear forms, optimizes eigenvalues of dissimilarity Gram matrix.
result Optimizes STRESS for non-Euclidean data.
A new method ranks uncertainty vectors from multiple measures for robust prediction.
problem Single scalar measures of model reliability are insufficient for comprehensive uncertainty quantification.
method Optimal transport ranks vectors of uncertainty measures, supporting flexible fusion of aleatoric and epistemic uncertainties.
result The method provides a robust ranking of uncertainty that supports various downstream tasks.
SPN and multidimensional upsampling generate high-fidelity images from small inputs.
problem Generating high-fidelity images from small inputs.
method Subscale Pixel Network (SPN) and multidimensional upsampling.
result Achieved state-of-the-art likelihood results and high-fidelity samples.
RS-HDMR-GPR simplifies complex functions with machine-learned lower-dimensional terms.
problem Representing and understanding complex multidimensional functions with sparse data.
method Random Sampling High Dimensional Model Representation Gaussian Process Regression (RS-HDMR-GPR).
result Facilitates recovery of functional dependence and adds insight into input variable importance.
The training of deep neural network classifiers results in decision boundaries which geometry is still not well understood. This is in direct relation with classification problems such as so called adversarial examples. We introduce zoNNscan, an index that is intended to inform on the boundary uncertainty (in terms of …
A new method combines POD and PCE for predicting multidimensional physical fields.
problem Predicting multidimensional non-linear fields from limited data.
method Combines Proper Orthogonal Decomposition (POD) and Polynomial Chaos Expansion (PCE).
result Demonstrates improved prediction accuracy and interpretability.
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…
This paper deals with multidimensional dynamic risk measures induced by conditional g-expectations. A notion of multidimensional g-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…
Slow feature analysis (SFA) is a method for extracting slowly varying features from a quickly varying multidimensional signal. An open source Matlab-implementation sfa-tk makes SFA easily useable. We show here that under certain circumstances, namely when the covariance matrix of the nonlinearly expanded data does not …
This paper improves conditional multidimensional scaling for incomplete data.
problem Handling missing data in known features for multidimensional scaling.
method Proposes a method to learn low-dimensional configurations with missing known feature values.
result Can learn low-dimensional configurations and impute missing values.
Modified multidimensional scaling improves clustering in noisy high-dimensional data.
problem Improving clustering accuracy in noisy high-dimensional data.
method Unified framework of multidimensional scaling, modified with nonlinear transformation.
result Modified multidimensional scaling achieves exact recovery of cluster labels with high probability.
The paper explores multidimensional critic output in GANs, improving convergence and diversity.
problem Underexplored in GANs literature, multidimensional critic output.
method Generalized Wasserstein GAN framework, SRVT block, maximal p-centrality discrepancy.
result High-dimensional critic output improves GAN performance in convergence and diversity.
Improved algorithm for multidimensional scaling reduces stress.
problem Stress in multidimensional scaling.
method Proposed modifications of the smacof algorithm.
result Convergent majorization algorithm for Kruskal's stress formula two.
A method to visualize multidimensional local subspaces using implicit differentiation.
problem Understanding the effect of multidimensional projection on local subspaces.
method Implicit function differentiation to analyze local subspaces shaped by multidimensional ellipses.
result Visualization of local subspaces provides insights into the global structure of data.
This paper improves MDS visualization by adjusting Wasserstein distances for heavy-tailed data.
problem Enhancing Multidimensional Scaling (MDS) for better pattern recognition with heavy-tailed distributions.
method Introduces Max-D-SW, a metric adjustment of Max-Sliced Wasserstein distance that aggregates over orthonormal bases.
result Max-D-SW provides a clear numerical advantage in MDS outcomes, especially for heavy-tailed distributions.
Paper analyzes classical multidimensional scaling for cluster recovery.
problem Cluster recovery from noisy data.
method Classical multidimensional scaling followed by distance-based clustering.
result Scaling conditions for high probability cluster recovery.
Global minima found for multidimensional scaling with penalties.
problem Finding global minima in multidimensional scaling.
method Combining stress loss function with a quadratic penalty term to find minimizers.
result Trajectory of minimizers leads to global minima.
Study uses multidimensional SE-NBD process to analyze default portfolios and identify shock amplification.
problem Analyzing interactions and shock propagation in default portfolios with multiple sectors.
method Applied multidimensional self-exciting negative binomial distribution (SE-NBD) process to 13 sectors.
result Identified upstream and downstream sectors, showing shock amplification in default portfolios.
Unified model combines neural networks and dictionary learning for clinical predictions from brain data.
problem Predicting clinical severity from brain imaging data.
method Combines neural networks with dictionary learning to model patient-specific and shared features.
result Unified model outperforms state-of-the-art methods in predicting clinical severity.
We propose a method (TT-GP) for approximate inference in Gaussian Process (GP) models. We build on previous scalable GP research including stochastic variational inference based on inducing inputs, kernel interpolation, and structure exploiting algebra. The key idea of our method is to use Tensor Train decomposition fo…
Efficiently recovers piecewise linear functions from noisy samples.
problem Recovering a piecewise linear function from noisy samples with unknown segmentation.
method Iterative merging approach for multidimensional segmented regression.
result First sample and computationally efficient algorithm in any fixed dimension.
We investigate aspects of semimartingale decompositions, approximation and the martingale representation for multidimensional correlated Markov processes. A new interpretation of the dependence among processes is given using the martingale approach. We show that it is possible to represent, in both continuous and discr…
New method learns psychological similarity spaces for unseen stimuli.
problem Generalizing psychological similarity spaces to new stimuli.
method Learn mapping from raw stimuli to similarity space using ANNs.
result ANNs can successfully map raw stimuli into similarity spaces.
This paper tackles clustering generalization by introducing a new concept based on multidimensional persistent homology.
problem The lack of general-purpose learning guarantees for data clustering.
method Introducing a new concept based on multidimensional persistent homology to analyze clustering generalization.
result The CR dilemma clarifies the contrast between overfitting and underfitting in clustering models.
Novel method for multiclass ROC curves using multidimensional Gini index.
problem Multiclass performance evaluation, especially for imbalanced datasets.
method Extends ROC curve methodology to multiclass settings using multidimensional Gini index.
result Validated through case studies in health care and finance.
We show that shortfall risks of American options in a sequence of multinomial approximations of the multidimensional Black--Scholes (BS) market converge to the corresponding quantities for similar American options in the multidimensional BS market with path dependent payoffs. In comparison to previous papers we conside…
A novel online framework for analyzing multidimensional functional data.
problem Analysis of multidimensional functional data streams poses significant challenges.
method Online functional principal component analysis using tensor product splines on a Stiefel manifold with Riemannian stochastic gradient descent.
result Efficient and scalable modeling of multidimensional functional data.
On the base of Lie algebraic and differential geometry methods, a wide class of multidimensional nonlinear systems is obtained, and the integration scheme for such equations is proposed.
Paper presents adaptive minimax risk classifiers for multidimensional concept drift.
problem Multidimensional concept drift in supervised classification.
method Adaptive minimax risk classifiers (AMRCs) tracking multivariate and high-order distribution changes.
result AMRCs provide computable tight performance guarantees and improve classification.
We analyze small price impacts in a multidimensional utility maximization problem using PDEs.
problem Small nonlinear price impacts in a multidimensional utility maximization problem.
method Asymptotic expansion using nonlinear PDEs related to ergodic control and linear parabolic PDEs.
result Leading order correction to the value function is characterized by a nonlinear second order PDE.
sWk-means clusters multidimensional financial time series into distinct market regimes.
problem Classifying distinct market regimes in multidimensional financial time series.
method Approximated multidimensional Wasserstein distance as sliced Wasserstein distance for clustering.
result sWk-means successfully identifies distinct market regimes in real financial data.
Recurrent Neural Networks (RNNs) are extensively used for time-series modeling and prediction. We propose an approach for automatic construction of a binary classifier based on Long Short-Term Memory RNNs (LSTM-RNNs) for detection of a vehicle passage through a checkpoint. As an input to the classifier we use multidime…
New method simulates sticky boundaries in multidimensional diffusions.
problem Simulating sticky boundaries in multidimensional diffusions.
method Approximate sticky diffusion by a Markov chain, using either finite difference or matching local moments.
result Validates both construction methods for first-order simulation schemes.
A new tensor regression model preserves multidimensional data structure.
problem Complex multidimensional data loses intrinsic connections and parameter explosion.
method Developed a parsimonious tensor regression model using Tucker structure and shrinkage penalization.
result The model outperforms benchmark models in forecasting.
Extends Carathéodory's theorem to multidimensional domains with constant curvature.
problem Characterizing biholomorphic domains with constant holomorphic curvature.
method Using Bergman representative coordinates and Calabi's diastasis.
result Provides sufficient conditions for the boundary of a biholomorphic ball to be a topological sphere.
We investigate the use of Malliavin calculus in order to calculate the Greeks of multidimensional complex path-dependent options by simulation. For this purpose, we extend the formulas employed by Montero and Kohatsu-Higa to the multidimensional case. The multidimensional setting shows the convenience of the Malliavin …
New method for learning multidimensional CDFs using Archimedean copulas.
problem Learning multidimensional CDFs in high dimensions.
method Generative modeling technique using Archimedean copulas as mixture models with latent variables from neural networks.
result Efficacy and computational efficiency compared to existing methods.
DPI quantifies phase differences in 1D and multidimensional signals using Riesz transform.
problem Quantifying phase differences in signals of varying dimensions.
method Riesz transform framework for harmonic analysis.
result DPI detects hypersynchronization and subtle changes in images and artworks.
Develops statistical confidence sets for multidimensional scaling.
problem Statistical uncertainty in multidimensional scaling of noisy data.
method Formal statistical framework, distributional convergence results, uniform confidence sets, bootstrap procedures.
result Construction of reliable confidence sets for latent configurations in multidimensional scaling.
Gaussian processes model geospatial trajectories with uncertainty.
problem Interpolating and predicting complex spatiotemporal data.
method Gaussian process models trajectories as multidimensional Gaussian distributions.
result Gaussian processes provide a flexible and probabilistic way to interpolate geospatial data.
Generalizations of the Weierstrass formulae to generic surface immersed into R4, S4 and into multidimensional Riemann spaces are proposed. Integrable deformations of surfaces in these spaces via the modified Veselov-Novikov equation are discussed.
Optimal B-robust estimate is constructed for multidimensional parameter in drift coefficient of diffusion type process with small noise. Optimal mean-variance robust (optimal V -robust) trading strategy is find to hedge in mean-variance sense the contingent claim in incomplete financial market with arbitrary informatio…
In this paper, we study optimal switching problems under ambiguity. To characterize the optimal switching under ambiguity in the finite horizon, we use multidimensional reflected backward stochastic differential equations (multidimensional RBSDEs) and show that a value function of the optimal switching under ambiguity …
In this paper the well-known Dubrovin-Novikov problem posed as long ago as 1984 in connection with the Hamiltonian theory of systems of hydrodynamic type, namely, the classification problem for multidimensional Poisson brackets of hydrodynamic type, is solved. In contrast to the one-dimensional case, in the general cas…