SGD converges to global minimum in deep learning via star-convex path.
problem Understanding how SGD trains deep neural networks to global minimum.
method Exploiting star-convex path and zero loss value properties of SGD.
result SGD converges deterministically to global minimum in deep learning.
Paper offers efficient methods for nonconvex functions.
problem Minimizing smooth quasar-convex functions.
method Near-optimal accelerated gradient descent method.
result Near-optimal number of function and gradient evaluations.
It is known that the (2k−1)-sphere has at most 2O(nklogn) combinatorially distinct triangulations with n vertices, for every k≥2. Here we construct at least 2Ω(nk) such triangulations, improving on the previous constructions which gave 2Ω(nk−1) in the general case (Kalai) and $2^{Ω(n^{5/…
New method quantifies uncertainty in kernel models without distributional assumptions.
problem Uncertainty quantification in kernel methods without strong distributional assumptions.
method Gradient perturbation to extract uncertainty information.
result Exact, non-asymptotic confidence regions for kernel models.
The paper analyzes and improves a deep learning optimization technique using matrix gradient orthogonality.
problem Improving deep learning training through more effective optimization methods.
method Develops a stochastic non-Euclidean trust-region gradient method for deep learning optimization.
result Proves state-of-the-art convergence results for the proposed algorithm in various scenarios.
Graph neural network predicts natural paths in graphs.
problem Predicting natural paths in graphs.
method Graph Neural Network (Gretel) for path extrapolation.
result Gretel efficiently predicts and samples from future path distributions.
The paper develops methods to price and hedge options in path-dependent stock models.
problem Pricing and hedging options under complex stock models.
method Develops a path-dependent PDE for option pricing and differentiability of path-dependent SDE solutions.
result Provides formulas for option Greeks and differentiability of path-dependent SDE solutions.
Extend classical theory of affine processes to path-dependent setting
problem Path-dependent affine processes
method Introduce path-dependent coefficients and provide analytic formulas for their Fourier--Laplace transform
result Define path-dependent affine processes through their exponential-affine Fourier--Laplace transform and establish a characterization theorem
Simpler method derived for path geometries on surfaces, characterizing projective path geometries.
problem Characterizing projective path geometries on surfaces.
method Solving the equivalence problem of sub-Riemannian geometry of signature (1,1) on a contact 3-manifold.
result Characterization of projective path geometries in terms of their chains.
Recently, path norm was proposed as a new capacity measure for neural networks with Rectified Linear Unit (ReLU) activation function, which takes the rescaling-invariant property of ReLU into account. It has been shown that the generalization error bound in terms of the path norm explains the empirical generalization b…
Proposes a novel path generation and evaluation method for video games.
problem Generating and evaluating realistic navigation paths for video games.
method Combines nonparametric model-free transformations and copula models.
result Demonstrates precise and interpretable generation of diverse navigation paths.
Partial covariance factorizes in path diagrams, simplifying analysis.
problem Understanding partial covariance in complex diagrams.
method Factorization of partial covariance over nodes and edges.
result Simpson's paradox cannot occur in singly-connected diagrams.
Introduces q-paths for generalizing geometric annealing paths in machine learning.
problem Limited applicability of existing path methods in machine learning.
method Develops a family of paths derived from a generalized mean, including geometric and arithmetic mixtures.
result Empirical gains in Bayesian inference and generative model evaluation.
This paper improves tail dependence analysis by introducing a path-based approach.
problem The classical tail dependence coefficient fails to capture non-exchangeable features of tail dependence.
method The paper introduces a path-based maximal tail dependence approach to capture the most pronounced feature of dependence over all possible paths.
result The paper proves the existence and provides an explicit characterization of the path-based maximal TDC, improving analytical and computational tractability.
This paper considers possible price paths of a financial security in an idealized market. Its main result is that the variation index of typical price paths is at most 2, in this sense, typical price paths are not rougher than typical paths of Brownian motion. We do not make any stochastic assumptions and only assume t…
Predicts path failures in evolving networks using deep learning.
problem Predicting path failures in time-evolving graphs.
method LRGCN, SAPE
result LRGCN outperforms other methods in path failure prediction.
One-shot path planning for multiple agents using neural networks.
problem Efficiently generating optimal or near-optimal paths for multiple agents in robotics.
method Utilizes fully convolutional neural networks for one-shot multi-agent path planning.
result Demonstrates successful generation of optimal or near-optimal paths in over 85% of cases for multi-path planning.
Foundation for robust finance using rough path theory.
problem Mathematical models of financial markets under Knightian uncertainty.
method Introducing Property (RIE) for càdlàg paths, proving existence of rough integrals, verifying admissibility of trading strategies.
result Existence and stability of rough path integrals for non-gradient integrands.
Paper proposes method for generating paths of stochastic volatility CGMY process for option pricing.
problem Generating accurate sample paths for stochastic volatility models for option pricing.
method Monte-Carlo method for European and American options, least square regression for calibration.
result Calibrated model parameters to S\&P 100 index options market using path-dependent options.
The paper proves signatures of non-geometric rough paths can approximate functionals uniformly.
problem Approximating functionals of non-geometric rough paths.
method Extending rough paths with time and quadratic variation terms, proving uniform approximation.
result Linear functionals of extended signatures uniformly approximate continuous functionals.
Proposes ANN for more accurate path loss prediction in urban environments.
problem Inaccurate path loss prediction in complex urban environments.
method Artificial Neural Network (ANN) for multi-dimensional regression modeling of path loss.
result The proposed ANN model is more accurate and flexible than conventional linear models.
A positive path in the linear symplectic group $\Sp(2n)$ is a smooth path which is everywhere tangent to the positive cone. These paths are generated by negative definite (time-dependent) quadratic Hamiltonian functions on Euclidean space. A special case are autonomous positive paths, which are generated by time-indepe…
Transports along path in fibre bundles are axiomatically introduced. Their general functional form and some their simple properties are investigated. The relationships of the transports along paths and lifting of paths are studied.
A new method predicts future paths using a Monte-Carlo approach.
problem Predicting future financial paths given historical data.
method Path Shadowing Monte-Carlo method using maximum entropy model.
result Yields state-of-the-art predictions for future volatility and option smiles.
The study proves unique path lifting properties and their implications on quotient spaces and covering maps.
problem Understanding unique path lifting properties and their implications on quotient spaces and covering maps.
method The study uses group actions on R-trees and path lifting properties to prove the main results. result Every map of manifolds with the unique path lifting property is a covering map.
This research improves DNN defense by profiling and analyzing effective paths.
problem Defending against adversarial attacks on deep neural networks.
method Profiling DNN models into functional blocks and aggregating per-image effective paths to class-level effective paths.
result Adversarial images activate different effective paths from normal images.
The paper calculates sensitivities for financial derivatives using path weighting methods.
problem Computing sensitivities for path-dependent financial derivatives with high variance and degeneracy issues.
method Proposes explicit path weighting formula, variance reduction adjustment, and covariance inflation technique.
result Effective methods to address high variance and degeneracy in sensitivities computation.
Path-connectivity shown for foliations on certain surfaces.
problem Path-connectivity of foliations on specific surfaces.
method Analyzing uniquely ergodic and cobounded foliations on surfaces of genus at least 5 or with at least one marked point.
result The set of uniquely ergodic and cobounded foliations is path-connected and locally path-connected for the specified surfaces.
Develops a numerical scheme for solving path-dependent FBSDEs and PDEs.
problem Solving path-dependent FBSDEs and PDEs numerically.
method Picard iteration method for FBSDEs, concentration inequality for estimator, supervised learning with neural networks for PDEs.
result Proves convergence and rate of convergence for the Picard iteration method.
Study of motion constraints and path-following on 3D space.
problem Path-following with non-holonomic constraints on R3. method Exploration of geometric structure and construction of guiding vector fields.
result General principles for constructing guiding vector fields for path-following.
Global invariant for path structures and differential equations defined on torus.
problem Global invariant for path structures and differential equations.
method Computed as a secondary invariant from a Cartan connection on a canonical bundle.
result Formula for global invariant of second order differential equations on torus.
This paper describes and evaluates the use of Generative Adversarial Networks (GANs) for path planning in support of smart mobility applications such as indoor and outdoor navigation applications, individualized wayfinding for people with disabilities (e.g., vision impairments, physical disabilities, etc.), path planni…
End-to-end KBQA system learns from multiple reasoning paths without labeled paths.
problem Lack of labeled reasoning paths limits KBQA system performance.
method End-to-end KBQA system using multiple reasoning paths.
result Demonstrates strong performance on various KBQA datasets.
PathRank ranks paths in spatial networks using multi-task learning.
problem Ranking paths in spatial networks for better navigation services.
method Data-driven framework using multi-task learning, spatial network embedding, and recurrent neural networks.
result PathRank effectively ranks paths based on historical trajectories.
Develops path-dependent optimal transport for exotic derivatives calibration.
problem Calibrating volatility models to exotic derivatives prices.
method Semimartingale optimal transport in path-dependent setting, duality results, dimension reduction via semifiltrations.
result Exact calibration of volatility models to path-dependent derivative prices.
In a rigorous construction of the path integral for supersymmetric quantum mechanics on a Riemann manifold, based on Bär and Pfäffle's use of piecewise geodesic paths, the kernel of the time evolution operator is the heat kernel for the Laplacian on forms. The path integral is approximated by the integral of a form on …
New algorithmic view of ℓ2 regularization using ODEs and path-following methods.
problem Optimizing convex loss functions with ℓ2 regularization.
method Established an equivalence between ℓ2-regularized solution paths and ODEs, proposing path-following algorithms based on homotopy methods and numerical ODE solvers.
result The solution path can be viewed as a hybrid of gradient descent and Newton method, providing novel schemes to choose grid points and reducing computational cost.
This work develops a generic framework, called the bag-of-paths (BoP), for link and network data analysis. The central idea is to assign a probability distribution on the set of all paths in a network. More precisely, a Gibbs-Boltzmann distribution is defined over a bag of paths in a network, that is, on a representati…
This research calculates node similarity on graphs using path-based kernels.
problem Computing similarity between nodes on graphs.
method Derives closed-form expressions for co-presence and co-occurrence of nodes on paths.
result Introduced kernels provide competitive results in semi-supervised classification.
Proposes a new method to learn entire solution paths without discretization.
problem Optimizing a family of problems indexed by hyperparameters.
method Parameterizes the solution path with basis functions and solves a single stochastic optimization problem.
result Uniform error of learned path converges linearly to a constant related to basis expressiveness.
We solve the paradox of score-based methods by minimizing path variance.
problem Score-based methods are path-dependent, leading to inaccurate and unstable estimators.
method Propose MVP Principle to minimize path variance, derive closed-form expression, and use flexible Kumaraswamy Mixture Model.
result Establishes new state-of-the-art results on challenging benchmarks.
Given two points on a soup can or conical cup with lid, we find and classify all paths of minimal length connecting them. When the number of minimal paths is finite, there are at most four on a can and three on a cup. At worst, minimal paths are piece-wise smooth with three components, each of which is a classical geod…
We study pathwise invariances of centred random fields that can be controlled through the covariance. A result involving composition operators is obtained in second-order settings, and we show that various path properties including additivity boil down to invariances of the covariance kernel. These results are extended…
Survey on rigorous construction of supersymmetric path integral.
problem Rigorous construction of supersymmetric path integral.
method Construction based on joint work with collaborators.
result Rigorous construction of supersymmetric path integral.
Flow Matching enables robust training of CNFs with various probability paths.
problem Training Continuous Normalizing Flows (CNFs) at large scales.
method Flow Matching (FM) is a simulation-free approach for training CNFs by regressing vector fields of conditional probability paths.
result Flow Matching with diffusion paths yields more robust and stable training compared to diffusion-based methods.
A 3D space of hyperbolic manifolds is connected but not path-connected.
problem Proving connectivity and non-path-connectedness of framed hyperbolic 3-manifolds.
method Two proofs using density theorems for Kleinian groups, constructing dense sets of framings, and discussing paths.
result The space of framed infinite volume hyperbolic 3-manifolds is not path-connected.
Dupire's functional Itô calculus provides an alternative approach to the classical Malliavin calculus for the computation of sensitivities, also called Greeks, of path-dependent derivatives prices. In this paper, we introduce a measure of path-dependence of functionals within the functional Itô calculus framework. Name…
Paper develops approximation and statistical theory for signature-based path regression.
problem Understanding how fast signatures approximate continuous path functionals.
method Develops \(L^2\) approximation rate for smooth functionals of Itô diffusions and establishes consistency of statistical learning procedures.
result Signature-based methods improve prediction over handcrafted features in various real-data applications.