arXiv research

The paper extends Marsden-Weinstein reduction to mechanical presymplectic structures for time-dependent Hamiltonian systems.

Paper compares Lagrangian reduction methods for rigid body systems.

Improved time complexity for parallel stochastic optimization in heterogeneous systems.

Paper identifies reductive MDPs, solving them in polynomial time.

In this paper we describe Routhian reduction as a special case of standard symplectic reduction, also called Marsden-Weinstein reduction. We use this correspondence to present a generalization of Routhian reduction for quasi-invariant Lagrangians, i.e. Lagrangians that are invariant up to a total time derivative. We sh…

A method for noise reduction in functional time series using FPCA.

Optimizes variance reduction in Heston model using large and moderate deviations.

Survey of Lagrangian reduction for discrete mechanical systems.

This paper uses UOT metrics for better dimensionality reduction and classification/clustering.

Balanced Neural ODEs combine VAEs and Neural ODEs for efficient time series modeling.

Efficiently reduces rank of non-negative matrices with quadratic time complexity.

Let $P$ be a parabolic subgroup of a connected simply connected complex semisimple Lie group $G$. Given a compact Kähler manifold $X$, the dimensional reduction of $G$-equivariant holomorphic vector bundles over $X\times G/P$ was carried out by the first and third authors. This raises the question of dimensional reduct…

In online advertising, display ads are increasingly being placed based on real-time auctions where the advertiser who wins gets to serve the ad. This is called real-time bidding (RTB). In RTB, auctions have very tight time constraints on the order of 100ms. Therefore mechanisms for bidding intelligently such as clickth…

In this paper we study the reductions of evolutionary PDEs on the manifold of the stationary points of time--dependent symmetries. In particular we describe how that the finite dimensional Hamiltonian structure of the reduced system is obtained from the Hamiltonian structure of the initial PDE and we construct the time…

New Einstein metrics found on orthogonal groups without natural reductivity.

We prove a reduction theorem for the tangent bundle of a Poisson manifold $(M, π)$ endowed with a pre-Hamiltonian action of a Poisson Lie group $(G, π_G)$. In the special case of a Hamiltonian action of a Lie group, we are able to compare our reduction to the classical Marsden-Ratiu reduction of $M$. If the manifold $M…

New Einstein metrics found on SU(N) without being naturally reductive.

WeldNet reduces complex dynamics to simpler, manageable segments.

Review and compare model order reduction methods for process engineering.

The BC(n) Sutherland Hamiltonian with coupling constants parametrized by three arbitrary integers is derived by reductions of the Laplace operator of the group U(N). The reductions are obtained by applying the Laplace operator on spaces of certain vector valued functions equivariant under suitable symmetric subgroups o…

We present sktime -- a new scikit-learn compatible Python library with a unified interface for machine learning with time series. Time series data gives rise to various distinct but closely related learning tasks, such as forecasting and time series classification, many of which can be solved by reducing them to relate…

The abstract discusses conditions for hyperkähler manifolds and Kähler reduction.

This work examines consistency issues in Gaussian Mixture Model reduction algorithms.

The un-reduction procedure introduced previously in the context of Mechanics is extended to covariant Field Theory. The new covariant un-reduction procedure is applied to the problem of shape matching of images which depend on more than one independent variable (for instance, time and an additional labelling parameter)…

Communication on heterogeneous edge networks is a fundamental bottleneck in Federated Learning (FL), restricting both model capacity and user participation. To address this issue, we introduce two novel strategies to reduce communication costs: (1) the use of lossy compression on the global model sent server-to-client;…

Geometrically reduces Hamiltonian systems using particular integrals.

Unsupervised learning of time series data, also known as temporal clustering, is a challenging problem in machine learning. Here we propose a novel algorithm, Deep Temporal Clustering (DTC), to naturally integrate dimensionality reduction and temporal clustering into a single end-to-end learning framework, fully unsupe…

A review of contrastive dimension reduction methods for treatment vs control studies.

For homogeneous reductive spaces G/H with reductive complements decomposable into an orthogonal sum \mathfrak{m}=\mathfrak{m}_1 \oplus \mathfrak{m}_2 \oplus \mathfrak{m}_3 of three Ad(H)-invariant irreducible mutually inequivalent submodules we establish simple conditions under which an invariant metric f-structure (f,…

This work extends reduction processes for nonholonomic discrete mechanical systems.

The diverse world of machine learning applications has given rise to a plethora of algorithms and optimization methods, finely tuned to the specific regression or classification task at hand. We reduce the complexity of algorithm design for machine learning by reductions: we develop reductions that take a method develo…

The study finds invariant Einstein metrics on complex Stiefel manifolds and special unitary groups.

In this paper we show that for the purposes of dimensionality reduction certain class of structured random matrices behave similarly to random Gaussian matrices. This class includes several matrices for which matrix-vector multiply can be computed in log-linear time, providing efficient dimensionality reduction of gene…

Despite the fact that they do not consider the temporal nature of data, classic dimensionality reduction techniques, such as PCA, are widely applied to time series data. In this paper, we introduce a factor decomposition specific for time series that builds upon the Bayesian multivariate autoregressive model and hence …

K-Nearest neighbor classifier (k-NNC) is simple to use and has little design time like finding k values in k-nearest neighbor classifier, hence these are suitable to work with dynamically varying data-sets. There exists some fundamental improvements over the basic k-NNC, like weighted k-nearest neighbors classifier (wh…

Introduces $b$-Lie groups and studies their symplectic structures and reductions.

The paper simplifies complex mechanical systems with external forces.

Paper proposes a tensor data model for incomplete imaging data.

In statistical learning, high covariate dimensionality poses challenges for robust prediction and inference. To address this challenge, supervised dimension reduction is often performed, where dependence on the outcome is maximized for a selected covariate subspace with smaller dimensionality. Prevalent dimension reduc…

In order to use the technique of dimensional reduction, it is usually necessary for there to be a symmetry coming from a group action. In this paper we consider a situation in which there is no such symmetry, but in which a type of dimensional reduction is nevertheless possible. We obtain a relation between the Coupled…

Inspired by the success of deep learning techniques in the physical and chemical sciences, we apply a modification of an autoencoder type deep neural network to the task of dimension reduction of molecular dynamics data. We can show that our time-lagged autoencoder reliably finds low-dimensional embeddings for high-dim…

We describe an action of $U(1)\times Sp(1)$ on $HP^7$ that allows to obtain a $Z_2$-quotient of CAYLEY (the Grassmannian of oriented 4-planes in $R^8$ closed under the three-fold cross product) by quaternionic Kähler reduction.

GT-PCA improves PCA for image and time series data.

Develops an efficient method for real-time data analysis and visualization.

Study surjectivity of Kirwan map for generalized hyperkähler reduction.

Study on BSDEs with random time horizon, focusing on existence and properties.

New method simplifies data analysis.

We show that deliberately introducing a nested simulation stage can lead to significant variance reductions when comparing two stopping times by Monte Carlo. We derive the optimal number of nested simulations and prove that the algorithm is remarkably robust to misspecifications of this number. The method is applied to…