This work introduces a method to learn dynamical systems from noisy sensor measurements using multiple shooting.
problem Learning dynamical systems from noisy sensor measurements is challenging due to system instability.
method A scalable method based on multiple shooting.
result Robust learning of latent representations of dynamical systems from noisy measurements.
The paper finds curves minimizing elastic energy pinned at endpoints.
problem Finding curves that minimize elastic energy with fixed endpoints.
method Applying the shooting method to identify and classify critical points.
result Critical points consist of wavelike elasticae, and minimizers have no loops or interior inflection points.
Study geodesic structure of compact balls space and find explicit isometry.
problem Geodesic structure of space of compact balls.
method Investigate the shooting property to find explicit isometry.
result Explicit isometry between (Σ(X),dH) and XimesR≥0. The paper proposes a new system ID method from noisy data.
problem System identification of linear and nonlinear non-autonomous systems from noisy and sparse data.
method Bayesian formulation for learning a hidden Markov model with stochastic dynamics, analyzed in the context of least squares and multiple shooting approaches.
result The proposed approach outperforms existing methods in terms of mean squared error and model generalizability.
Modified curve shortening flow constructs λ-Angenent curve.
problem Constructing λ-Angenent curve. method Modified curve shortening flow
result Constructs λ-Angenent curve. Bayesian ODEs with Gaussian processes infer unknown dynamics from data.
problem Estimating unknown continuous-time system dynamics from data.
method Bayesian nonparametric model using Gaussian processes, sparse variational inference, probabilistic shooting.
result Posterior predictive uncertainty scores outperform alternative methods on multiple ODE learning tasks.
MSLs use parallelizable root-finding for efficient ODE and PDE solutions.
problem Efficiently solving initial value problems for ODEs and PDEs.
method Leveraging time-parallel methods, MSLs use parallelizable root-finding algorithms.
result MSLs offer significant speedups in NFEs and inference time.
Research suggests using deep learning for better recommendation systems.
problem Recommender systems rely on proxies for A/B testing, leading to random success.
method Advocates for using deep learning to improve recommendation performance.
result Deep learning can potentially optimize reward in recommendation systems.
We develop a machine learning approach to represent and analyze the underlying spatial structure that governs shot selection among professional basketball players in the NBA. Typically, NBA players are discussed and compared in an heuristic, imprecise manner that relies on unmeasured intuitions about player behavior. T…
Develops a machine learning framework for computing most probable paths in stochastic systems.
problem Computing the most probable paths in stochastic dynamical systems.
method Reformulates the boundary value problem of Hamiltonian systems and uses a neural network to solve the Euler-Lagrange equation for the Onsager-Machlup action functional.
result Demonstrates the efficacy and accuracy of the machine learning approach in computing most probable paths for stochastic systems with various types of noise.
In this paper we show the existence of a closed, embedded λ-hypersurfaces Σ⊂R2n. The hypersurface is diffeomorhic to Sn−1×Sn−1×S1 and exhibits SO(n)×SO(n) symmetry. Our approach uses a "shooting method" similar to the approach used by McG…
Classifies solutions to critical sixth order equations with a singularity.
problem Classifying entire positive singular solutions to critical sixth order equations.
method Integral sliding methods, qualitative analysis of ODEs, topological two-parameter shooting technique.
result Solutions are given by a singular radial factor times a periodic solution to a sixth order IVP with constant coefficients.
Randomized gradient-based ensemble improves prediction accuracy.
problem Improving prediction accuracy in machine learning.
method Randomization and gradient-based aggregation of weakly-correlated estimators.
result The method outperforms existing techniques in terms of increased accuracy.
Gaussian process model learns Hamiltonian systems from noisy data.
problem Learning Hamiltonian systems from long, noisy trajectories.
method Efficient decoupled parameterisation, energy-conserving shooting method.
result Robust inference from short and long trajectories.
Bayesian Neural ODEs improve vessel trajectory prediction with better uncertainty estimates.
problem Challenges in predicting vessel trajectories from irregular AIS data.
method Adopted a Gaussian process (GP) kernel-based prior on the vector field evaluated at measurement points, combined with probabilistic multiple shooting for long trajectories.
result Improved accuracy and uncertainty quantification in vessel trajectory predictions.
TinyBayes detects crop diseases from images on edge devices with high accuracy and minimal resources.
problem Automated disease detection for cocoa crops in resource-constrained settings.
method Combines YOLOv8-Nano for lesion localisation, MobileNetV3-Small for feature extraction, and Jacobi prior for Bayesian classification.
result Achieves 78.7% accuracy on Amini Cocoa Contamination Challenge dataset with 9.5 MB model size and 150 ms inference time.
The Kepler-Heisenberg problem is that of determining the motion of a planet around a sun in the sub-Riemannian Heisenberg group. The sub-Riemannian Hamiltonian provides the kinetic energy, and the gravitational potential is given by the fundamental solution to the sub-Laplacian. This system is known to admit closed orb…
Countries tend to diversify their exports by entering products that are related to their current exports. Yet this average behavior is not representative of every diversification path. In this paper, we introduce a method to identify periods when countries enter unrelated products. We analyze the economic diversificati…
An efficient algorithm for Riemannian logarithm on Stiefel manifold family.
problem Efficient computation of Riemannian logarithm on Stiefel manifold for various metrics.
method Generalizes a matrix-algebraic approach for the canonical metric to a one-parameter family of metrics.
result Conserves local linear convergence for the family of metrics.
Given an isoparametric function f on the n-dimensional sphere, we consider the space of functions w∘f to reduce the Yamabe equation on the round sphere into a singular ODE on w in the interval [0,π], of the form w"+(h(r)/sinr)w′+λ(∣w∣4/n−2w−w)=0, where h is a monotone function with …
Minimal surfaces in spheres constructed from symmetry reductions of ODEs.
problem Construct minimal surfaces in spheres with symmetry.
method Doubling links of free-boundary minimal cones in R^(p+q+3) with bi-orthogonal symmetry.
result Existence of minimal embeddings of S^p × S^q × S^1 in S^(p+q+2).
Analyzes a critical spherical catenoid in hyperbolic space, proving its index and nullity.
problem Proves the strong form of Medvedev's Morse index conjecture for a specific minimal surface.
method Analytic local resolution via reductions and Sturm shooting-count arguments.
result Analytic local resolution of the strong Medvedev conjecture for the critical spherical catenoid.
This paper focuses on the study of open curves in a Riemannian manifold M, and proposes a reparametrization invariant metric on the space of such paths. We use the square root velocity function (SRVF) introduced by Srivastava et al. to define a Riemannian metric on the space of immersions M'=Imm([0,1],M) by pullback of…
Extended orbit model theory for shape analysis using graded group action framework.
problem Limitations of standard orbit model theory in shape analysis.
method Developed graded group action (GGA) framework with regularity conditions.
result Uniqueness result for momentum map trajectory in multi-scale shape spaces.
Camera model identification refers to the problem of linking a picture to the camera model used to shoot it. As this might be an enabling factor in different forensic applications to single out possible suspects (e.g., detecting the author of child abuse or terrorist propaganda material), many accurate camera model att…
This text is intended to become in the long run Chapter 3 of our long saga dedicated to Riemann, Ahlfors and Rohlin. Yet, as its contents evolved as mostly independent (due to our inaptitude to interconnect both trends as strongly as we wished), it seemed preferable to publish it separately. More factually, our account…
The aim of this work is to explore the possible types of phenomena that simple macroeconomic Agent-Based models (ABM) can reproduce. We propose a methodology, inspired by statistical physics, that characterizes a model through its 'phase diagram' in the space of parameters. Our first motivation is to understand the lar…
Improved iterative methods for risk parity portfolio weights.
problem Solving for portfolio weights in risk parity allocation.
method Enhanced CCD and Newton methods, including a rescaling step and improved initial guess.
result Improved CCD method is the best, three times faster with 40% fewer iterations.
We describe a novel optimization method for finite sums (such as empirical risk minimization problems) building on the recently introduced SAGA method. Our method achieves an accelerated convergence rate on strongly convex smooth problems. Our method has only one parameter (a step size), and is radically simpler than o…
A new method combines Laplace and Variational Bayes for scalable inference.
problem Complex models and large datasets make exact inference infeasible.
method Low-Rank Variational Bayes Correction (VBC) using Laplace method and Variational Bayes correction in a lower dimension.
result The method ensures scalability in both model complexity and data size.
Unified framework for model explanation methods based on feature removal.
problem Unclear relationships and preferences among various model explanation methods.
method Characterizes removal-based explanations along three dimensions.
result Unified 26 existing methods, including widely used approaches.
This work reviews and evaluates methods for predicting prediction intervals in regression problems.
problem Calibration of prediction intervals in regression problems.
method Four classes of methods: Bayesian, ensemble, direct interval estimation, and conformal prediction.
result Conformal prediction can be used as a general calibration procedure.
Derives kernel PCA with Nyström method for scalability.
problem Scalability of kernel PCA.
method Nyström method for kernel PCA.
result Provides scalable alternative to full kernel PCA.
In this paper, the author considers the numerical computation of CVA for large systems by Mote Carlo methods. He introduces two types of stochastic mesh methods for the computations of CVA. In the first method, stochastic mesh method is used to obtain the future value of the derivative contracts. In the second method, …
New method combines spectral and sparse methods for Gaussian processes.
problem Efficiently fitting Gaussian processes to large datasets.
method Orthogonally decoupled variational Fourier features.
result Competitive performance on synthetic and real-world data.
Simple stochastic Newton and cubic Newton methods with fast convergence.
problem Minimizing large numbers of smooth and strongly convex functions.
method Stochastic Newton and cubic Newton methods with simple local linear-quadratic rates.
result Local linear-quadratic convergence results with fast adaptation to problem's curvature.
A comprehensive benchmark of 15 scRNA-seq imputation methods across various datasets and analyses.
problem Imputation of single-cell RNA sequencing data to recover latent transcriptional signals.
method Evaluation of 15 imputation methods across 30 datasets and 6 downstream analyses.
result Traditional methods generally outperform DL-based methods in scRNA-seq data analysis.
New methods using natural gradient for structured optimization.
problem Structured optimization problems.
method Structured second-order methods via natural gradient descent.
result Efficiency demonstrated on non-convex and deep learning problems.
Recently, {\it stochastic momentum} methods have been widely adopted in training deep neural networks. However, their convergence analysis is still underexplored at the moment, in particular for non-convex optimization. This paper fills the gap between practice and theory by developing a basic convergence analysis of t…
We investigate methods for pricing American options under the variance gamma model. The variance gamma process is a pure jump process which is constructed by replacing the calendar time by the gamma time in a Brownian motion with drift, which makes it a time-changed Brownian motion. In general, the finite difference me…
A new method speeds up deep neural network training.
problem Nonconvex optimization in deep neural networks.
method Scaled conjugate gradient method for nonconvex optimization.
result The method converges faster and achieves lower scores in practical applications.
We propose a new stochastic dual coordinate ascent technique that can be applied to a wide range of regularized learning problems. Our method is based on Alternating Direction Multiplier Method (ADMM) to deal with complex regularization functions such as structured regularizations. Although the original ADMM is a batch…
NCG methods improve shape optimization efficiency.
problem Shape optimization problems
method Nonlinear conjugate gradient methods
result NCG methods are efficient for shape optimization
Geometric methods study 3-manifold splittings.
problem Studying Heegaard splittings of 3-manifolds.
method Geometric approaches.
result Recent advances in geometric methods.
We propose two localized Radial Basis Function (RBF) methods, the Radial Basis Function Partition of Unity method (RBF-PUM) and the Radial Basis Function generated Finite Differences method (RBF-FD), for solving financial derivative pricing problems arising from market models with multiple stochastic factors. We demons…
Proposes UTC method for stock price prediction with uncertainty quantification.
problem Lack of uncertainty estimates in stock prediction methods.
method Combines TC method with probabilistic modeling for point and uncertainty predictions.
result UTC method achieves higher returns and lower risks than baselines.
Various approaches to gene selection for cancer classification based on microarray data can be found in the literature and they may be grouped into two categories: univariate methods and multivariate methods. Univariate methods look at each gene in the data in isolation from others. They measure the contribution of a p…
Survey of spectral, probabilistic, and deep metric learning methods.
problem Developing effective distance metrics for various machine learning tasks.
method Divided into spectral, probabilistic, and deep approaches, covering various techniques and their applications.
result Comprehensive overview of metric learning methods, including new developments and applications.