In this paper, we establish some sharp inequalities between the volume and the integral of the k-th mean curvature for k+1-convex domains in the Euclidean space. The results generalize the classical Alexandrov-Fenchel inequalities for convex domains. Our proof utilizes the method of optimal transportation.
State-of-the-art methods in convex and non-convex optimization employ higher-order derivative information, either implicitly or explicitly. We explore the limitations of higher-order optimization and prove that even for convex optimization, a polynomial dependence on the approximation guarantee and higher-order smoothn…
The paper solves a 25-year-old problem about maximal growth distributions on manifolds.
problem Existence and classification of maximal growth distributions on smooth manifolds.
method Higher order convex integration and new criteria for ampleness of differential relations.
result Positive answer to the open question about parallelizable manifolds admitting maximal growth distributions.
Lower bounds for higher-order methods in non-convex optimization.
problem Proving lower bounds for higher-order methods in smooth non-convex finite-sum optimization.
method Analyzing deterministic and randomized algorithms, proposing a new smoothness assumption.
result Proves optimal lower bounds for simulating pth-order regularized methods on the whole function.
Local invertibility of higher order tensor transforms on compact manifolds.
problem Invertibility of higher order tensor transforms on compact manifolds.
method Local invertibility of transverse and mixed ray transforms of tensors on compact Riemannian manifolds.
result Local invertibility of transverse and mixed ray transforms of tensors for specific dimensions.
We deduce from the work of Chen, that the restriction morphism from closed free iterated integrals to closed iterated integrals on loops is onto. We use this to show that the module of higher order invariants of smooth functions is generated by free closed iterated integrals.
Paper tackles non-convex optimization for higher moments in portfolio management.
problem Complexity of higher moments in optimization problems.
method Method of successive convex approximation.
result Solves mean-variance-skewness problem using non-convex optimization.
The paper connects higher order risk measures and stochastic dominance, showing their equivalence and integrating them with optimization.
problem Comparing and characterizing random outcomes in risk assessment.
method Exploring the equivalence between higher order risk measures and stochastic dominance, using stochastic optimization and expectiles as examples.
result Higher order risk measures and stochastic dominance are equivalent and can be used to characterize random outcomes.
Extends Nash-Kuiper theorem to higher Hölder exponents.
problem Constructing isometric immersions beyond Borisov's exponent.
method Novel corrugation ansatz, integration by parts, and algebraic decomposition.
result Flexibility of C1,α isometric immersions beyond Borisov's exponent. New model estimates higher-order interactions in stochastic processes using lower-dimensional projections.
problem Estimating higher-order interaction effects in stochastic processes with limited data.
method Additive Poisson Process (APP) combines information geometry and generalized additive models to model intensity functions in lower dimensions.
result The model can estimate higher-order intensity functions with sparse data.
We provide improved convergence rates for various \emph{non-smooth} optimization problems via higher-order accelerated methods. In the case of ℓ∞ regression, we achieves an O(ε−4/5) iteration complexity, breaking the O(ε−1) barrier so far present for previous methods. We arrive at a similar rate fo…
Improved algorithms for convex-concave min-max optimization and monotone variational inequalities.
problem Efficiently solving constrained convex-concave min-max problems and monotone variational inequalities.
method Higher-order methods achieving iteration complexities of O(1/T^{rac{p+1}{2}}) for p-th order derivatives.
result Achieved improved convergence rates for min-max and monotone variational inequalities.
Study optimizes zero-order strongly convex function minimization with higher order smoothness.
problem Optimizing a strongly convex function with noisy evaluations.
method Randomized approximation of projected gradient descent with smoothing kernel.
result Upper bounds and minimax lower bounds for the algorithm, showing near-optimality.
Improved estimation of higher order integrals using shrinkage techniques.
problem Estimating higher order Bochner integrals in non-parametric settings.
method Shrinkage of U-statistic towards a target element, considering kernel degeneracy.
result Consistent shrinkage estimators with fast rates of convergence, even for non-degenerate kernels.
The paper extends inequalities for convex bodies to higher dimensions and various norms.
problem Extending inequalities for convex bodies to higher dimensions and various norms.
method Developed new operators and inequalities for higher-order Lp norms. result Established mth-order Lp isoperimetric inequalities. Expands differential geometry to higher-order infinitesimals.
problem No specific problem stated; general expansion of differential geometry.
method Introduces higher tangent vectors and jet connections, generalizes Riemannian metric tensor, develops higher-order integration theory.
result Natural analogues of Riemannian curvature tensor with novel phenomena.
We present a geometric interpretation of the integration-by-parts formula on an arbitrary vector bundle. As an application we give a new geometric formulation of higher-order variational calculus.
Paper proves flexibility of specific relations using convex integration.
problem Holonomic approximation theorem in differential topology.
method Proves the holonomic approximation theorem for first order jets using convex integration.
result Relation is open and ample, leading to flexibility of the theorem.
We prove sharp blow up rates of solutions of higher order conformally invariant equations in a bounded domain with an isolated singularity, and show the asymptotic radial symmetry of the solutions near the singularity. This is an extension of the celebrated theorem of Caffarelli-Gidas-Spruck for the second order Yamabe…
New method solves complex curvature equations.
problem Solving semilinear scalar curvature equations.
method Mixed convex integration method.
result New proof of scalar curvature result.
Local search heuristics for non-convex optimizations are popular in applied machine learning. However, in general it is hard to guarantee that such algorithms even converge to a local minimum, due to the existence of complicated saddle point structures in high dimensions. Many functions have degenerate saddle points su…
The paper derives new inequalities on manifolds and applies them to convex hypersurfaces.
problem Deriving new inequalities on manifolds and convex hypersurfaces.
method Using Fourier theory and geometric implications of Poincare-type inequalities.
result Sharp Minkowski-type inequalities, including stability and Alexandrov-Fenchel inequalities.
We propose a Markov chain Monte Carlo (MCMC) algorithm based on third-order Langevin dynamics for sampling from distributions with log-concave and smooth densities. The higher-order dynamics allow for more flexible discretization schemes, and we develop a specific method that combines splitting with more accurate integ…
Disproves Fedotov's conjecture on higher-order Shephard inequalities.
problem Fedotov's conjecture on higher-order Shephard inequalities.
method Using Hodge-Riemann relations for simple convex polytopes.
result Fedotov's conjecture is disproved.
We develop a theory of higher-order feature attribution for complex models.
problem Interpreting feature contributions in models with interactions is challenging.
method We extend Integrated Gradients (IG) to higher-order feature attributions.
result We establish natural connections to statistics and topological signal processing.
In this article, we study the problem of pricing defaultable bond with discrete default intensity and barrier under constant risk free short rate using higher order binary options and their integrals. In our credit risk model, the risk free short rate is a constant and the default event occurs in an expected manner whe…
Paper proposes an efficient algorithm to handle high-order portfolio moments.
problem Designing portfolios with high-order moments (skewness and kurtosis) is computationally challenging.
method Proposes a SCA algorithm framework for solving high-order portfolios efficiently.
result Demonstrates the efficiency of the proposed algorithm through numerical experiments.
We consider the minimization of submodular functions subject to ordering constraints. We show that this optimization problem can be cast as a convex optimization problem on a space of uni-dimensional measures, with ordering constraints corresponding to first-order stochastic dominance. We propose new discretization sch…
The paper studies curvature flows in hyperbolic space and proves geometric inequalities.
problem Proving geometric inequalities in hyperbolic space using curvature flows.
method Locally constrained curvature flows, h-convexity, and shifted principal curvatures.
result Established new sharp geometric inequalities comparing curvature integrals to quermassintegrals.
The present paper develops two concepts of pointwise differentiability of higher order for arbitrary subsets of Euclidean space defined by comparing their distance functions to those of smooth submanifolds. Results include that differentials are Borel functions, higher order rectifiability of the set of differentiabili…
Paper proposes a new tensor model for mixed memberships and provides error bounds.
problem Estimating mixed memberships in higher-order multiway data.
method Tensor mixed-membership blockmodel, higher-order orthogonal iteration algorithm (HOOI), simplex corner-finding algorithm.
result Consistency of estimation procedure with error bounds under specific conditions.
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.
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.
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.
Cochran defined the nth-order integral Alexander module of a knot in the three sphere as the first homology group of the knot's (n+1)th-iterated abelian cover. The case n=0 gives the classical Alexander module (and polynomial). After a localization, one can get a finitely presented module over a principal ideal domain,…
This paper studies a particular class of higher order conformally invariant dif- ferential operators and related integral operators acting on functions taking values in particular finite dimensional irreducible representations of the Spin group. The differential operators can be seen as a generalization to higher spin …
Mixes higher-order simplicial complexes for data augmentation.
problem Lack of labeled data for complex systems with multiway interactions.
method Proposes mixup mechanisms for simplicial complexes, including linear and nonlinear mixup, and a convex clustering mixup.
result Synthetic simplicial complexes interpolate between existing data based on homomorphism densities.
Researchers create higher-dimensional I′-curvatures and find counterexamples to the Hirachi conjecture.
problem The Hirachi conjecture in higher CR dimensions.
method Constructing higher-dimensional I′-curvatures and analyzing their properties under contact form changes. result Total integrals of I′-curvatures depend on the choice of contact form, providing counterexamples to the Hirachi conjecture. We introduce higher order mean curvatures of screen almost conformal (SAC) half-lightlike submanifolds of indefinite contact manifolds, admitting a semi-symmetric non-metric connection, and use them to generalize some known results of [6]. Also, we derive a new set of integration formulae via the divergence of some spe…
We show a higher order integrability theorem for distributions generated by a family of vector fields under a horizontal regularity assumption on their coefficients. We use as chart a class of almost exponential maps which we discuss in details
We study underlying geometric structures for integral variational functionals, depending on submanifolds of a given manifold. Applications include (first order) variational functionals of Finsler and areal geometries with integrand the Hilbert 1-form, and admit immediate extensions to higher-order functionals.
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.
Hamiltonian dynamics-based algorithms achieve deterministic and accelerated convergence for convex optimization.
problem Accelerating convex optimization
method Hamiltonian dynamics
result Hamiltonian dynamics-based algorithms achieve deterministic and accelerated convergence for convex optimization.
Study improves BN TTA under distribution shift using higher-order asymptotics.
problem Improving BN TTA for changing data distributions.
method Integrates Edgeworth expansion and saddlepoint approximation with one-step M-estimation.
result Derives optimal weighting parameter for minimized mean-squared error.
H-GAT improves stock selection by capturing complex higher-order stock relations and integrating both technical and fundamental analysis.
problem Stock selection difficulty and lack of comprehensive analysis.
method Higher-order Graph Attention Network (H-GAT) that incorporates both technical and fundamental analysis.
result H-GAT outperforms existing methods in stock selection metrics.
Study first-order locally convex Lie algebroids in Bastiani calculus.
problem Define and study first-order locally convex Lie algebroids.
method Define sheaves of Lie algebroid forms and morphisms, prove category structure, study representations and cohomology.
result First-order locally convex Lie algebroids form a category and have applications in Lie II theorems.
In this article, we consider a 2 factors-model for pricing defaultable bond with discrete default intensity and barrier where the 2 factors are stochastic risk free short rate process and firm value process. We assume that the default event occurs in an expected manner when the firm value reaches a given default barrie…
Expands learning paradigm to stochastic orders using Choquet-Toland distance and Variational Dominance Criterion.
problem Learning high-dimensional distributions with stochastic orders.
method Introduces Choquet-Toland distance and Variational Dominance Criterion, uses input convex maxout networks (ICMNs).
result Proposes surrogates for Choquet-Toland distance and Variational Dominance Criterion with parametric rates.