New method uses higher-order Langevin dynamics for efficient parallel sampling.
problem Efficient parallel sampling from high-dimensional log-concave distributions.
method Combines higher-order Langevin dynamics with blockwise Lagrange polynomial interpolation.
result Reduces the number of parallel points required for a target accuracy.
A new method predicts higher-order interactions in evolving graphs using simplicial complexes.
problem Predicting higher-order interactions in dynamic graphs with theoretical guarantees.
method Capturing higher-order interactions as simplices, modeling neighborhoods with face-vectors, and developing a nonparametric kernel estimator.
result Our method outperforms existing higher-order prediction methods and is theoretically consistent.
A new method uses higher-order Langevin dynamics with critical damping for better generative modeling.
problem Improving generative models using Langevin dynamics with auxiliary variables.
method Introducing higher-order Langevin dynamics with critical damping, providing closed-form solutions.
result Improved generative models with better performance as measured by FID metric.
This work learns models for population dynamics using variational methods and higher-order quadrature.
problem Modeling population dynamics of physical systems with stochastic and mean-field effects.
method Variational problem to infer gradient fields, combining Monte Carlo sampling with higher-order quadrature rules.
result Accurate prediction of population dynamics over a wide range of parameters.
In this paper, we describe a geometric setting for higher-order lagrangian problems on Lie groups. Using left-trivialization of the higher-order tangent bundle of a Lie group and an adaptation of the classical Skinner-Rusk formalism, we deduce an intrinsic framework for this type of dynamical systems. Interesting appli…
This paper examines how Higher-Order Langevin Dynamics reduces memorization in diffusion models.
problem Memorization of training samples in diffusion models, violating copyright and privacy.
method Introduces Higher-Order Langevin Dynamics (HOLD) to regularize diffusion model trajectories.
result The dynamics of the data variable in HOLD are governed by a low-pass-filtered version of the learned score function, with smoothness increasing with model order.
The moments of spatial probabilistic systems are often given by an infinite hierarchy of coupled differential equations. Moment closure methods are used to approximate a subset of low order moments by terminating the hierarchy at some order and replacing higher order terms with functions of lower order ones. For a give…
Proposes efficient sampling methods for solving linear inverse problems.
problem Solving linear inverse problems with computational efficiency and accuracy.
method Higher-order Langevin diffusion with pre-conditioning and annealing.
result Provable sampling from posterior distributions with accelerated convergence.
Bayesian method detects mesoscale structures in pathway data networks.
problem Mesoscale structures in pathway data networks are hard to detect due to dependencies between interactions.
method Bayesian approach modeling optimal partitioning and higher-order dynamics.
result Method can recover both proximity-based and role-based groupings of nodes.
In this paper we derive the symplectic framework for field theories defined by higher-order Lagrangians. The construction is based on the symplectic reduction of suitable spaces of iterated jets. The possibility of reducing a higher-order system of PDEs to a constrained first-order one, the symplectic structures natura…
Proposes exact inference for continuous-time Gaussian process dynamics.
problem Inexact inference methods for continuous-time Gaussian process dynamics are impractical for irregularly-sampled data.
method Uses higher-order numerical integrators to discretize dynamics with arbitrary accuracy and proposes multistep and Taylor integrators for exact inference.
result Demonstrates accurate representation of continuous-time systems through exact GP inference.
Paper proves higher-order flow matching preserves optimality in generative modeling.
problem Theoretical guarantees for higher-order flow matching in generative modeling.
method Neural network approximations with controlled depth, width, and sparsity.
result Proves worst case optimality for second-order flow matching.
Diffusion models learn simple statistics before complex ones, revealing a sample complexity exponent.
problem Understanding the learning dynamics of diffusion models.
method Empirical observations and theoretical analysis of diffusion models and denoisers.
result Diffusion models learn simple statistics (pair-wise correlations) at linear sample complexity, while higher-order statistics (e.g., fourth cumulant) require cubic sample complexity.
The aim of this paper is to propose an unambiguous intrinsic formalism for higher-order field theories which avoids the arbitrariness in the generalization of the conventional description of field theories, which implies the existence of different Cartan forms and Legendre transformations. We propose a differential-geo…
The need to efficiently calculate first- and higher-order derivatives of increasingly complex models expressed in Python has stressed or exceeded the capabilities of available tools. In this work, we explore techniques from the field of automatic differentiation (AD) that can give researchers expressive power, performa…
Enhances stock movement prediction using Higher Order Transformers for multimodal time-series data.
problem Predicting stock movements in financial markets with complex dynamics.
method Introduced Higher Order Transformers, extending self-attention and transformer architecture to capture complex market dynamics. Employed low-rank tensor decomposition and kernel attention to manage computational complexity. Integrated technical and fundamental analysis from historical prices and tweets.
result Demonstrated effectiveness of the method on the Stocknet dataset, improving stock movement prediction.
Biological neurons learn tensor decompositions of higher-order correlations using nonlinear Hebbian plasticity.
problem Learning higher-order correlations in biological neurons.
method Introduce and study generalized nonlinear Hebbian learning rules.
result Neurons can learn tensor eigenvectors of higher-order input correlation tensors.
New principle for optimal control with higher order differential constraints.
problem Optimal control problems with higher order differential constraints.
method Derivation of the Principle of Minimal Labour and generalization of Pontryagin Maximum Principle.
result Generalized Pontryagin Maximum Principle for higher order constraints.
A method to estimate high order derivatives of data distributions from samples.
problem Estimating high order derivatives of data distributions efficiently and accurately.
method Generalizing denoising score matching via Tweedie's formula to estimate higher order derivatives.
result Models trained with the proposed method can approximate second order derivatives more efficiently and accurately than via automatic differentiation.
The work proposes a geometric background of the theory of field interactions and strings in spaces with higher order anisotropy. Our approach proceeds by developing the concept of higher order anisotropic superspace which unifies the logical and mathematical aspects of modern Kaluza-Klein theories and generalized Lagra…
Framework predicts nonlinear system responses using GFDT and generative models.
problem Predicting higher-order moments of nonlinear stochastic systems to small perturbations.
method Combining GFDT with generative modeling to estimate score function directly from data.
result Accurately captures nonlinear and non-Gaussian features of system responses.
Higher-order geometry modifies Newtonian dynamics and predicts anomalies in spacecraft motion.
problem Observing and understanding higher-order effects in general relativity.
method Generalizing the Einstein-Hilbert action to include higher-order infinitesimals and studying field equations and cosmologies.
result Higher-order corrections predict anomalies like the Pioneer and flyby effects.
Comprehending complex systems by simplifying and highlighting important dynamical patterns requires modeling and mapping higher-order network flows. However, complex systems come in many forms and demand a range of representations, including memory and multilayer networks, which in turn call for versatile community-det…
Paper defends diffusion models from membership inference attacks using Langevin dynamics.
problem Defending diffusion models against membership inference attacks.
method Uses critically-damped higher-order Langevin dynamics with auxiliary variables.
result Demonstrates improved resistance to membership inference attacks through theoretical investigation and validation.
HAMD optimizes cubic portfolios without quadratization, achieving better results.
problem Optimizing higher-order portfolio models with reduced distortion.
method Hybrid pipeline combining continuous Hamiltonian search, cardinality-preserving projection, and iterated local search.
result HAMD achieves significantly lower native cubic objective values than classical heuristics.
Motivated by obtaining a consistent mathematical description for the radiation reaction of point charged particles in linear classical electrodynamics, a theory of generalized higher order tensors and differential forms is introduced. The generalization of some fundamental notions of the differential geometry and the t…
We develop and implement a novel fast bootstrap for dependent data. Our scheme is based on the i.i.d. resampling of the smoothed moment indicators. We characterize the class of parametric and semi-parametric estimation problems for which the method is valid. We show the asymptotic refinements of the proposed procedure,…
Study quantifies how LLMs capture higher-order statistical structure using cumulant expansion.
problem Understanding how LLMs internalize statistical structure during next-token prediction.
method Cumulant-expansion framework treating softmax entropy as perturbation around center distribution.
result Cumulants reveal distinct signatures for mathematical vs. general text prompts, quantifying feature-learning dynamics.
Flat surfaces that correspond to k-differentials on compact Riemann surfaces are of finite area provided there is no pole of order k or higher. We denote by \textit{flat surfaces with poles of higher order} those surfaces with flat structures defined by a k-differential with at least one pole of order at least $k…
New method finds open subsets with trivial holonomy for certain geometries.
problem Finding open subsets with trivial holonomy for Cartan geometries.
method Analyzing the behavior of isotropies in model geometries to generalize properties of isolated higher-order fixed points.
result Existence of open subsets with trivial holonomy for Cartan geometries with certain isotropies.
Networks are a natural representation of complex systems across the sciences, and higher-order dependencies are central to the understanding and modeling of these systems. However, in many practical applications such as online social networks, networks are massive, dynamic, and naturally streaming, where pairwise inter…
The CGMY model's ATM call-price asymptotics are derived using characteristic function.
problem Deriving short-time asymptotics for the CGMY model's ATM call prices.
method Using the characteristic function, derived short-time asymptotics for the CGMY model's ATM call prices. Extracted higher-order coefficients by dynamic cutoff partitioning.
result Higher-order coefficients are derived for the CGMY model's ATM call prices.
Training deep neural networks with spatio-temporal (i.e., 3D) or multidimensional convolutions of higher-order is computationally challenging due to millions of unknown parameters across dozens of layers. To alleviate this, one approach is to apply low-rank tensor decompositions to convolution kernels in order to compr…
We derive a higher-order expansion for rough volatility models.
problem Characterizing and estimating rough volatility models.
method Higher-order asymptotic expansion of characteristic functions.
result Distinct roles of rough and jump dynamics in volatility.
Optimal Control Theory optimizes neural networks, improving robustness and efficiency.
problem Optimizing deep neural networks (DNNs) for better performance and efficiency.
method Integrating Optimal Control Theory with Backpropagation to develop a new optimizer.
result Optimal Control Theoretic Neural Optimizer (OCNOpt) improves upon existing methods in robustness and efficiency.
Paper characterizes equilibrium strategies for stochastic control with higher-order moments.
problem Stochastic control problems with higher-order moments.
method Novel characterization of time-consistent control problems, deriving equilibrium conditions via BSDEs.
result Derives sufficient and necessary conditions for an open-loop Nash equilibrium control (ONEC) in a novel way.
Paper tackles stochastic control with mean and higher-order moments, finding Nash equilibria.
problem Time-inconsistent stochastic control problems with mean and higher-order moments.
method Developed closed-loop and open-loop Nash equilibrium controls using PDEs and maximum principles.
result Identical closed-loop and open-loop Nash equilibria controls, independent of state value and random path.
A new HOM model improves forecasting of Indian base metal prices.
problem Improving accuracy in predicting base metal prices in the Indian market.
method A Higher Order Markovian (HOM) model with varying order based on market delay.
result The HOM model consistently outperforms the standard Markovian model in forecasting.
Predictive coding networks are shown to be stable, robust, and converge faster than backpropagation.
problem Stability, robustness, and convergence of predictive coding networks.
method Dynamical systems theory and Lyapunov stability analysis.
result Predictive coding networks are Lyapunov stable and converge faster than backpropagation.
A few generalizations of a Poisson algebra to field theory canonically formulated in terms of the polymomentum variables are discussed. A graded Poisson bracket on differential forms and an (n+1)-ary bracket on functions are considered. The Poisson bracket on differential forms gives rise to various generalizations o…
A new method learns dynamic graph representations from time-varying data.
problem Learning dynamic graph representations from time-varying data.
method Higher-order skip-gram with negative sampling (HOSGNS) for tensor factorization.
result HOSGNS outperforms state-of-the-art methods in downstream tasks.
HLRC offers a new curvature metric for hypergraphs that balances interpretability and efficiency.
problem Challenges in geometric characterization of hypergraphs with higher-order interactions.
method Hypergraph lower Ricci curvature (HLRC) defined in closed form.
result HLRC consistently reveals meaningful higher-order organization in diverse hypergraph datasets.
Paper introduces Tensor Gauge Flow Models for better data encoding.
problem Lack of expressive flow dynamics in existing Generative Flow Models.
method Incorporates higher-order Tensor Gauge Fields into the Flow Equation.
result Tensor Gauge Flow Models achieve improved generative performance.
Dynamic Vine Copulas detect and quantify time-varying higher-order interactions in multivariate systems.
problem Time-varying dependence in multivariate systems, including tail behavior, asymmetry, and conditional structure.
method Dynamic Vine Copulas (DVC) framework for estimating and diagnosing non-Gaussian dependence, using fixed-root-order C-vines and smooth parameter trajectories.
result DVC detects and quantifies time-varying higher-order interactions, distinguishing between pairwise and conditional dependence.
For certain classes of knots we define geometric invariants called higher-order genera. Each of these invariants is a refinement of the slice genus of a knot. We find lower bounds for the higher-order genera in terms of certain von Neumann ρ-invariants, which we call higher-order signatures. The higher-order genera o…
A fundamental property of complex networks is the tendency for edges to cluster. The extent of the clustering is typically quantified by the clustering coefficient, which is the probability that a length-2 path is closed, i.e., induces a triangle in the network. However, higher-order cliques beyond triangles are crucia…
Stability of capillary hypersurfaces with higher order mean curvature.
problem Stability of capillary hypersurfaces with constant higher order mean curvature.
method Generalization of classical stability theory for capillary hypersurfaces.
result Results on stability for capillary hypersurfaces with higher order mean curvature.
A key feature of inductive logic programming (ILP) is its ability to learn first-order programs, which are intrinsically more expressive than propositional programs. In this paper, we introduce techniques to learn higher-order programs. Specifically, we extend meta-interpretive learning (MIL) to support learning higher…