Proves existence and uniqueness of solutions to Lp Minkowski problem for electrostatic p-capacity.
problem Existence and uniqueness of solutions to Lp Minkowski problem for electrostatic p-capacity.
method Proved existence and uniqueness of solutions for specific ranges of p and p-capacity.
result Proves existence and uniqueness of solutions for Lp Minkowski problem for electrostatic p-capacity.
Proves existence and uniqueness of solutions to the Lp Gaussian Minkowski problem.
problem Existence and uniqueness of solutions to the Lp Gaussian Minkowski problem.
method Analyzes existence and uniqueness of solutions for different values of p.
result Existence and uniqueness of smooth solutions for p > n.
Study on convex capillary hypersurfaces with Lp curvature in half-space.
problem Prescribed Lp curvature for convex capillary hypersurfaces.
method Reduction to Hessian quotient equation with Robin boundary condition.
result Existence and uniqueness of smooth admissible solutions.
The paper solves a generalized Christoffel-Minkowski problem using a curvature flow.
problem Solving the (p,q)-Christoffel-Minkowski problem.
method Investigating the problem via an expanding curvature flow.
result Existence and uniqueness of smooth solutions to the (p,q)-Christoffel-Minkowski problem.
Unified Minkowski problem discussed for (p,q)-mixed quermassintegrals.
problem Unified Minkowski problem for (p,q)-mixed quermassintegrals.
method Introducing (p,q)-mixed quermassintegrals and (p,q)-dual mixed curvature measure to study the Minkowski problem.
result Derivation of important properties and geometric inequalities for (p,q)-mixed quermassintegrals.
Paper introduces new L p L_p L p q q q -torsional measure and solves Minkowski problem.
problem Solving the Minkowski problem for q q q -torsional rigidity. method Established L p L_p L p variational formula and proved existence of solutions. result Existence of solutions to L p L_p L p Minkowski problem for specific measures. Paper solves capillary Lp-Minkowski problem for p>1.
problem Finding capillary convex bodies with prescribed Lp-surface area measures.
method Reduction to Monge-Ampère equation with Robin boundary condition.
result Solved capillary Lp-Minkowski problem in smooth category for p>1.
Anisotropic expanding flow of convex hypersurfaces converges to a soliton under certain conditions.
problem Anisotropic expanding curvature flows of convex hypersurfaces in Euclidean space.
method Proving the existence and convergence of a unique smooth and uniformly convex solution to the flow under specific conditions.
result The flow converges to a soliton which solves an elliptic equation when parameters are within a suitable range.
New method prunes large causal bounds LPs for scalable inference.
problem Computing causal bounds on graphs with unobserved confounders.
method Pruning LP formulations for scalability, extending to fractional LPs.
result Significant runtime improvement and scalable inference for large problems.
Optimizes liquidity withdrawal timing for AMM LPs to balance fees and impermanent loss.
problem Balancing fees and impermanent loss in automated market makers.
method Stochastic control problem with endogenous stopping time, numerical solutions via Euler scheme and Longstaff-Schwartz method.
result Optimal exit strategy depends on volatility, fees, and market dynamics.
New LP method recovers MAP solution from noisy stable instances.
problem MAP inference on noisy stable instances.
method Designing an algorithm to find nearby perturbation stable instances and using LP relaxation.
result LP approximately recovers the MAP solution from noisy stable instances.
Graph neural networks improve solving linear optimization problems.
problem Improving the efficiency of solving linear optimization problems.
method Using graph neural networks to simulate standard interior-point methods for linear optimization problems.
result Graph neural networks can solve linear optimization problems close to optimality, often outperforming conventional solvers.
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.
New algorithms solve L1-regularized SVMs and related LPs, outperforming existing methods.
problem Solving large-scale L1-regularized SVMs and related linear programs.
method Combining column/constraint generation with first-order methods for non-smooth convex optimization.
result Our approach significantly outperforms commercial solvers and specialized implementations.
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…
FLAIR measures LP competitiveness in AMMs, improving LP performance evaluations.
problem LP returns are affected by both market risk and competitive strategies.
method Introduces FLAIR metric to quantify LP competitiveness and assesses its impact on LP returns.
result FLAIR captures dynamic behavior of LPs and differentiates between active provisioning strategies.
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.
LP algorithm optimizes neural networks with architectural constraints.
problem Training neural networks with specific architectural constraints.
method Lagrangian optimization and saddle point search in adjoint space.
result LP algorithm is fully parallelizable and feasible for training deep networks.
Much effort has been directed at algorithms for obtaining the highest probability configuration in a probabilistic random field model known as the maximum a posteriori (MAP) inference problem. In many situations, one could benefit from having not just a single solution, but the top M most probable solutions known as th…
Study on LP-Sasakian manifolds with generalized η-Ricci solitons.
problem Properties of LP-Sasakian manifolds with generalized η-Ricci solitons.
method Investigation of LP-Sasakian manifolds with generalized η-Ricci solitons associated to the general connection.
result Existence of generalized η-Ricci solitons on a 4-dimensional LP-Sasakian manifold.
Optimal fees for G3Ms align LP value with market accuracy.
problem Optimal fees for G3Ms to attract liquidity without sacrificing accuracy.
method Developed a framework for determining LP value with fees for G3Ms under diffusion.
result LPs prefer G3Ms over other strategies as fees approach zero.
The paper analyzes the convergence rates of smooth message passing algorithms in entropy-regularized MAP inference.
problem Finding the most likely configuration in graphical models with combinatorial optimization.
method Entropy-regularized linear programming relaxations and smooth message passing algorithms.
result The number of iterations sufficient to recover the true integral MAP solution is determined.
A new method improves label propagation for unsupervised domain adaptation.
problem Improving unsupervised domain adaptation through semi-supervised learning techniques.
method Label Propagation with Augmented Anchors (A 2 ^2 2 LP) for UDA. result A 2 ^2 2 LP improves over representative UDA methods and benchmarks. 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…
A slice distance for the class of weak abelian Lp-bundles in 3 dimensions was introduced in a previous article in collaboration with Tristan Rivière, where it was used to prove the closure of such class of bundles for the weak Lp-convergence. We further investigate this distance here, and we prove more properties of it…
Proves Hölder continuity of complex Monge-Ampère solutions.
problem Global Hölder continuity of solutions to complex Monge-Ampère equation.
method Analyzes Dirichlet problem on strictly pseudoconvex domains or Hermitian manifolds.
result Proves global Hölder continuity of solutions under given conditions.
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…
The abstract discusses p-harmonic forms and their geometric properties, proving new theorems about Lp-cohomology.
problem The abstract tackles the geometric properties of p-harmonic forms and their role in Lp-cohomology.
method The approach involves using p-harmonic and p-coclosed forms to reprove vanishing theorems and provide injectivity theorems.
result The main finding is the reproof of vanishing theorems and the provision of injectivity theorems for Lp-cohomology.
New algorithm optimizes decision-making for complex systems with varying parameters.
problem Optimizing decisions in systems with varying parameters and heterogeneous restlessness.
method Model Predictive Control (MPC) approach with randomized rounding for heterogeneous RMABs.
result Achieves an O ( log N 1 / N ) O(\log N\sqrt{1/N}) O ( log N 1/ N ) optimality gap in infinite time average reward problems. New algorithms accelerate MAP inference in Markov fields with faster convergence.
problem Finding the most likely configuration in discrete-valued Markov random fields.
method Entropy-regularized linear programming with accelerated gradient methods.
result Accelerated algorithms find optimal solutions faster, especially when the LP is tight.
Optimizes arm selection with side information in Gaussian bandits.
problem Optimizing arm selection with side information in Gaussian bandits.
method Constructs an LP-based asymptotic instance-dependent lower bound on the regret and develops the first known asymptotically optimal algorithm.
result First known asymptotically optimal algorithm for Gaussian bandits with side information.
Study anisotropic flows solving Orlicz-Minkowski problems, proving existence and new results.
problem Anisotropic non-homogeneous Gauss curvature flows and Orlicz-Minkowski problems.
method Long-time existence and behavior analysis, parabolic approximation method, curvature flow.
result Existence and new results for Orlicz-Minkowski problems, including L p L_p L p versions. Optimizes liquidity provision intervals for profitable AMM participation.
problem Financial losses from poor liquidity provision intervals and reallocation costs.
method Developed a tractable stochastic optimization problem.
result Computes optimal liquidity provision intervals for profitable liquidity concentration.
Study on liquidity providers' performance in decentralized exchanges.
problem Unclear profitability of liquidity providers in decentralized exchanges.
method Reconstructing LP PnL dynamics from on-chain events, introducing a new metric.
result Only about one out of six LPs avoids losses, suggesting open questions about LP participation motives.
This paper improves online learning algorithms for LP problems, achieving better regret bounds.
problem Achieving optimal regret bounds in online linear programming.
method Develops a new framework for first-order online learning algorithms under certain error bound conditions.
result First-order learning algorithms achieve o ( T ) o(\sqrt{T}) o ( T ) regret in continuous support and O ( log T ) \mathcal{O}(\log T) O ( log T ) regret in finite support, improving over O ( T ) \mathcal{O}(\sqrt{T}) O ( T ) . Researchers prove uniqueness and continuity of solution to L_p dual Minkowski problem.
problem Proving uniqueness and continuity of solution to L_p dual Minkowski problem.
method Established new Minkowski-type inequalities related to optimization problem.
result Uniqueness and continuity of solution for general convex bodies when q < p q < p q < p . Developed a sub-Riemannian version of Minkowski problem in Heisenberg groups.
problem Minkowski type problem in Heisenberg groups.
method Variational method.
result Positive answer to sub-Riemannian Minkowski type problem.
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.
Paper solves Minkowski problem for anisotropic p-torsional rigidity.
problem Solving the Minkowski problem for anisotropic p-torsional rigidity.
method Using the anisotropic p p p -Laplacian equation, presenting sufficient and necessary conditions for existence. result Presented sufficient and necessary conditions for the existence of a solution.
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…
Study analyzes factors affecting profits in crypto liquidity provision.
problem Liquidity providers lack guidance for developing profitable strategies.
method Developed a measurement model based on impermanent loss to analyze key parameters.
result Uncovered influences of key parameters on LPs' profits.
New method solves generalized Minkowski problem for torsional rigidity.
problem Generalized Minkowski problem for torsional rigidity.
method Flow method
result Existence of solutions for general measures.
Solves a discrete logarithmic Minkowski problem for electrostatic p-capacity.
problem Characterize measures generated by electrostatic p-capacity.
method Solves the discrete logarithmic Minkowski problem for 1 < p < n.
result Solves the discrete logarithmic Minkowski problem for measures in general position.
Paper solves Minkowski problem for p-harmonic measures.
problem Solving the Minkowski problem for p-harmonic measures on convex domains.
method Using the Gauss curvature flow method.
result Existence of smooth solution to the Minkowski problem for p-harmonic measures.
Study anisotropic inverse Gauss curvature flows and solve dual Orlicz Minkowski problems.
problem Solving dual Orlicz Minkowski problems for anisotropic flows.
method Anisotropic inverse Gauss curvature flows and stationary solutions.
result New existence results for dual Orlicz Minkowski problems for smooth measures.
Study proves only origin-centered spheres solve certain curvature problems.
problem Proving uniqueness of solutions to curvature problems.
method Using the Heintze-Karcher inequality, the study proves the uniqueness of smooth, strictly convex solutions to a class of Minkowski type problems.
result Only origin-centered spheres solve isotropic and L p L_p L p -Gaussian-Minkowski problems. This paper solves the dual Minkowski problem for q-torsional rigidity.
problem The dual Minkowski problem for q-torsional rigidity.
method Introduced the p-th dual q-torsional measure and solved the p-th dual Minkowski problem for q-torsional rigidity using a Gauss curvature flow.
result Existence of smooth even and non-even solutions to the p-th dual Minkowski problem for q-torsional rigidity.
New algorithm reduces online decision-making regret with efficient LP re-solving and parallel first-order method.
problem Worse regret guarantees and high computational cost of LP-based OLP algorithms.
method Combines LP-based and first-order OLP methods, re-solving LP subproblems periodically and using parallel first-order method.
result Achieves O ( log ( T / f ) + f ) \mathscr{O}(\log (T/f) + \sqrt{f}) O ( log ( T / f ) + f ) regret, balancing computational efficiency and superior regret guarantee.