Research
On-device research index

arXiv research

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.

168,742 papers · 148 categories

Trend · papers per month

count% of corpus
0111 · Oct 202019922001200920172026
4 results for “ball-convex”
Ball-convex bodies and LpL_p relative surface areasmath.MG

New surface area measures defined for ball-convex bodies, leading to entropy and inequalities.

problem Defining and analyzing surface area measures for ball-convex bodies.
method Introducing LpL_p relative surface areas, proving invariance and inequalities, and using geometric interpretations.
result Established inequalities and a new notion of entropy for ball-convex bodies.
surface area measuresball-convex bodiesrigid motion invarianceentropyinequalities
2025-12-22abs ↗pdf ↗
Illumination bodies for ball-convex bodiesmath.MG

New illumination bodies defined for ball-convex shapes, proving convexity and establishing surface area measures.

problem Characterizing properties of ball-convex shapes.
method Introducing illumination bodies and weighted illumination bodies, proving convexity, and establishing surface area measures.
result Illumination bodies are convex and provide surface area measures for ball-convex shapes.
illumination bodiesball-convexconvexitysurface areaisoperimetric inequality
2026-07-15abs ↗pdf ↗
Robustness Analysis of Neural Networks via Efficient Partitioning with Applications in Control Systemscs.LG

Paper improves neural network robustness analysis for safety-critical systems.

problem Uncertainty in neural network outputs for safety-critical systems.
method Unified propagation and partition approaches to provide tighter bounds.
result Proposed algorithms give tighter bounds than existing methods for the same computation time.
Neural NetworksRobustness AnalysisControl SystemsUncertainty PropagationPartitioning
2020-10-01abs ↗pdf ↗
The Ball-Proximal (="Broximal") Point Method: a New Algorithm, Convergence Theory, and Applicationsmath.OC

A new optimization method, BPM, converges linearly in non-convex, non-smooth problems.

problem Non-smooth and non-convex optimization challenges.
method Ball-Proximal Point Method (BPM), inspired by Proximal Point Method (PPM).
result BPM converges linearly and in a finite number of steps in non-convex, non-smooth problems.
optimizationnon-convexnon-smoothglobal convergencelinear convergence
2025-02-04abs ↗pdf ↗