A locally-built, LLM-digested index of recent arXiv papers in quant finance, geometry/topology, and statistical ML — keyword search served straight from SQLite on this machine.
Classifies SL(n) covariant matrix-valued valuations on Lp-spaces.
problem Classifying SL(n) covariant matrix-valued valuations on Lp-spaces.
method Established a complete classification for continuous and SL(n) covariant matrix-valued valuations on Lp(Rn,|x|2dx), eliminating matrix symmetry assumption.
result Unique characterization of such valuations by the moment matrix in n>2, rotation matrix in 2D.
Sharp Lp affine isoperimetric inequalities are established for the entire class of Lp projection bodies and the entire class of Lp centroid bodies. These new inequalities strengthen the Lp Petty projection and the Lp Busemann--Petty centroid inequality.
MAP inference for general energy functions remains a challenging problem. While most efforts are channeled towards improving the linear programming (LP) based relaxation, this work is motivated by the quadratic programming (QP) relaxation. We propose a novel MAP relaxation that penalizes the Kullback-Leibler divergence…
JIT liquidity providers can sometimes reduce overall market liquidity by crowding out passive LPs.
problem JIT liquidity providers can reduce overall market liquidity by crowding out passive LPs.
method Game-theoretic model with asymmetrically informed agents to analyze JIT liquidity provision in blockchain-based decentralized exchanges.
result JIT LPs only provide liquidity to uninformed orders and crowd out passive LPs when order volume is not sufficiently elastic to pool depth, potentially reducing overall market liquidity.
In this paper, we give a new sharp generalization bound of lp-MKL which is a generalized framework of multiple kernel learning (MKL) and imposes lp-mixed-norm regularization instead of l1-mixed-norm regularization. We utilize localization techniques to obtain the sharp learning rate. The bound is characterized by the d…
Structured prediction is used in areas such as computer vision and natural language processing to predict structured outputs such as segmentations or parse trees. In these settings, prediction is performed by MAP inference or, equivalently, by solving an integer linear program. Because of the complex scoring functions …
The object of the present paper is to study locally φ-symmetric LP-Sasakian manifolds admitting semi-symmetric metric connection and obtain a necessary and sufficient condition for a locally φ-symmetric LP-Sasakian manifold with respect to semi-symmetric metric connection to be locally φ-symmetric LP-Sasakian man…
In this work we introduce a category of discrete Lagrange--Poincare systems LP_d and study some of its properties. In particular, we show that the discrete mechanical systems and the discrete mechanical systems obtained by the Lagrangian reduction of symmetric discrete mechanical systems are objects in LP_d. We introdu…
The paper explores how ReLU DNNs can represent MPC policies and vice versa.
problem Representing MPC policies as ReLU DNNs and vice versa.
method Developed an approximate method for identifying input-space in ReLU nets resulting in PWA functions over polyhedral regions. Studied inverse multiparametric linear or quadratic programs for reconstruction of constraints and cost functions given a PWA function.
result Identification and representation of MPC policies as ReLU DNNs and vice versa.
The linear Support Vector Machine (SVM) is a classic classification technique in machine learning. Motivated by applications in modern high dimensional statistics, we consider penalized SVM problems involving the minimization of a hinge-loss function with a convex sparsity-inducing regularizer such as: the L1-norm on t…
We use a new combinatorial technique to prove the optimal interior partial regularity result for Lp-vectorfields with integer fluxes minimizing the Lp-energy. More precisely, we prove that the minimal vectorfields are Hölder outside a set which is locally finite inside the domain. The results continue the program start…
Label assignment problems with large state spaces are important tasks especially in computer vision. Often the pairwise interaction (or smoothness prior) between labels assigned at adjacent nodes (or pixels) can be described as a function of the label difference. Exact inference in such labeling tasks is still difficul…
Existence and uniqueness of the solution to the discrete Lp Minkowski problem for p-capacity are proved when p≥1 and 1<p<n. For general Lp Minkowski problem for p-capacity, existence and uniqueness of the solution are given when p≥1 and 1<p≤2. These r…
We prove that the first reduced cohomology with values in a mixing Lp-representation, p larger than 1, vanishes for a class of amenable groups including connected amenable Lie groups. In particular this solves for this class of amenable groups a conjecture of Gromov saying that every finitely generated amenable group h…
The main purpose in the present paper is to build a Hamiltonian theory for fields which is consistent with the principles of relativity. For this we consider detailed geometric pictures of Lepage theories in the spirit of Dedecker and try to stress out the interplay between the Lepage-Dedecker (LP) description and the …
Inhomogeneities in real-world data, e.g., due to changes in the observation noise level or variations in the structural complexity of the source function, pose a unique set of challenges for statistical inference. Accounting for them can greatly improve predictive power when physical resources or computation time is li…