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

178356534712 · Jun 202019922001200920172026
48 results for robust hollow star numbers

The paper introduces a method for creating short proofs of predictions in AI models.

problem Creating reliable and explainable AI predictions.
method Defining robust hollow star numbers and analyzing certificate sizes for various hypothesis classes.
result The certificate coefficient εx\varepsilon_x precisely controls the sample size needed for predictions.

Hollow-tree Super resolves feature importance in large datasets.

problem Lack of effective scaling for large feature numbers in boosted tree models.
method Hollow-tree Super (HOTS) methodology for feature importance visualization.
result HOTS effectively resolves feature importance and directionality in high-dimensional neuroscientific data.

Estimates how many times a star appears due to gravitational lensing.

problem Estimating the number of times an observer sees a star due to gravitational lensing.
method Use affine linking numbers to estimate the number of times an observer sees a star.
result Estimates the number of times an observer sees a star due to gravitational lensing.

Study tunnel numbers of cable knots and their companions, proving new bounds and constructing examples.

problem Understanding the relationship between the tunnel numbers of a knot and its cable.
method Combinatorial techniques and analysis of Heegaard splittings.
result Proves that for many cases, the tunnel number of a cable knot equals the original knot's tunnel number plus one.

This paper is devoted to an inverse Steklov problem for a particular class of n-dimensional manifolds having the topology of a hollow sphere and equipped with a warped product metric. We prove that the knowledge of the Steklov spectrum determines uniquely the associated warping function up to a natural invariance.

2019-09-27abs ↗pdf ↗

This paper achieves first-order regret bounds in reinforcement learning with large state spaces.

problem Achieving first-order regret bounds in reinforcement learning with large state spaces.
method Developed a novel robust self-normalized concentration bound based on the robust Catoni mean estimator.
result Obtained regret bounds scaling as O~(d3H3V1K+d3.5H3logK)\widetilde{\mathcal{O}}(\sqrt{d^3 H^3 \cdot V_1^\star \cdot K} + d^{3.5}H^3\log K ).

Paper solves Serrin problem for ring-shaped domains, showing velocity has finitely many maxima.

problem Characterizing rotationally symmetric solutions to a specific PDE on a ring-shaped domain.
method Introduced new arguments in the spirit of comparison geometry to overcome the lack of monotonicity.
result Simplest conditions are not sufficient; rotational symmetry requires finitely many maxima.

New algorithm minimizes regret in sparse reinforcement learning.

problem Sparse reinforcement learning with unknown sparsity.
method Doubly robust approach combining feature vectors of all actions and novel analysis.
result Regret bound of ildeO(σmin1sHN) ilde{O}(σ^{-1}_{\min} s_{\star} H \sqrt{N}).

New algorithm for robust density estimation in corrupted data.

problem Density estimation in the presence of adversarial corruption.
method Proposes an algorithm for constructing a density estimator within a star-shaped density class, derived minimax bounds for estimation.
result Obtained minimax upper and lower bounds for density estimation under adversarial corruption.

In discrete differential geometry, it is widely believed that the discrete Gaussian curvature of a polyhedral vertex star equals the algebraic area of its Gauss image. However, no complete proof has yet been described. We present an elementary proof in which we compare, for a particular normal vector, its winding numbe…

2019-09-19abs ↗pdf ↗

We introduce a method to design lightweight shell objects that are structurally robust under the external forces they may experience during use. Given an input 3D model and a general description of the external forces, our algorithm generates a structurally-sound minimum weight shell object. Our approach works by alter…

2019-06-25abs ↗pdf ↗

We study the fundamental problem of high-dimensional mean estimation in a robust model where a constant fraction of the samples are adversarially corrupted. Recent work gave the first polynomial time algorithms for this problem with dimension-independent error guarantees for several families of structured distributions…

2018-11-23abs ↗pdf ↗

Proposes an efficient alternative to nonconvex-nonconcave min-max optimization.

problem Min-max optimization challenges in nonconvex-nonconcave settings.
method Introduces ε-greedy adversarial equilibrium model and proves its existence.
result Existence of ε-greedy adversarial equilibrium for smooth bounded functions.

The study shows infinitely many Reeb orbits on star-shaped hypersurfaces with growth rate like prime numbers.

problem Growth rate of Reeb orbits on star-shaped hypersurfaces.
method Analyzing fiberwise star-shaped hypersurfaces in cotangent bundles with topological conditions.
result The number of Reeb orbits with period at most T grows at least like T/log(T).

Improved guarantees for nonconvex matrix factorization with rank overparameterization.

problem Minimizing nonconvex objective over low-rank matrices.
method Overparameterized Burer--Monteiro approach, leveraging smoothness and strong convexity.
result Local optimization globally converges to global optimum under certain rank conditions.

The study proves that in normal tilings, at least two vertices are required per cell.

problem Understanding the minimum number of vertices required in normal tilings.
method The research examines both periodic and monohedral tilings in 2D, proving the minimum number of non-smooth vertices required.
result The study confirms that for normal tilings, at least two vertices are necessary per cell.

The goal of this study is to present the development of a machine learning based approach that utilizes phase space alone to separate the Gaia DR2 stars into two categories: those accreted onto the Milky Way from those that are in situ. Traditional selection methods that have been used to identify accreted stars typica…

2019-07-15abs ↗pdf ↗

We calculated the cross correlations between the half-hourly times series of the ten Dow Jones US economic sectors over the period February 2000 to August 2008, the two-year intervals 2002--2003, 2004--2005, 2008--2009, and also over 11 segments within the present financial crisis, to construct minimal spanning trees (…

2010-09-29abs ↗pdf ↗

Minimizing a convex, quadratic objective of the form fA,b(x):=12xAxb,xf_{\mathbf{A},\mathbf{b}}(x) := \frac{1}{2}x^\top \mathbf{A} x - \langle \mathbf{b}, x \rangle for A0\mathbf{A} \succ 0 is a fundamental problem in machine learning and optimization. In this work, we prove gradient-query complexity lower bounds for minimizing conv…

2018-07-24abs ↗pdf ↗

Paper proves conjecture about star-shaped curves evolving under GAPF, but not always preserves star shape.

problem What conditions guarantee global existence of Gage's area-preserving flow for nonconvex initial curves?
method Using Dittberner's singularity analysis theory, constructed a ``flying wing'' curve to show limitations.
result Gage's area-preserving flow does not always preserve star-shapedness of evolving curves.

In this article, we introduce the notion of star-Ricci tensors in the real hypersurfaces of complex quadric QmQ^m. It is proved that there exist no Hopf hypersurfaces in Qm,m3Q^m,m\geq3, with commuting star-Ricci tensor or parallel star-Ricci tensor. As a generalization of star-Einstein metric, star-Ricci solitons on MM

2017-10-29abs ↗pdf ↗

Optimal scheme minimizes deviation in federated transfer learning for kernel regression.

problem Minimizing cumulative deviation in federated transfer learning across multiple datasets.
method Regret-optimal iterative scheme for continual communication between nodes and server.
result Explicit updates for the regret-optimal algorithm in finite-rank kernel regression.

New set-valued star-shaped risk measures introduced for better risk assessment.

problem Improving risk assessment in financial contexts.
method Developed new set-valued star-shaped risk measures and proved their representation theorems.
result Set-valued star-shaped risk measures can be represented as unions of set-valued convex risk measures.

We study Veech groups of covering surfaces of primitive translation surfaces. Therefore we define congruence subgroups in Veech groups of primitive translation surfaces using their action on the homology with entries in Z/aZ\mathbb{Z}/a\mathbb{Z}. We introduce a congruence level definition and a property of a primitive t…

2014-03-19abs ↗pdf ↗

The paper studies dynamic star-shaped risk measures and their representation.

problem Representing dynamic star-shaped risk measures and their properties.
method Representation theorems for dynamic monetary and star-shaped risk measures.
result Dynamic star-shaped risk measures can be represented as the lower envelope of a family of dynamic convex risk measures.

The paper characterizes dynamic return and star-shaped risk measures via BSDEs.

problem Characterizing dynamic return and star-shaped risk measures.
method Characterization of star-shaped functionals and BSDEs.
result Existence of convex BSDEs with non-empty set of supersolutions.

Gradient descent learns over-param neural nets better than NTK.

problem Learning over-parametrized neural networks with ReLU activations.
method Gradient descent from random initialization on a Gaussian input distribution.
result Gradient descent achieves population loss o(1/d)o(1/d), while NTK achieves Ω(1/d)Ω(1/d).

Deform moment map on symplectic connections using star product algebras.

problem Understanding symplectic connections and their deformations.
method Study vector bundle of Fedosov star product algebras, formal connection, curvature, and star product trace.
result Showed star product trace as a formal symplectic form and moment map.