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,657 papers · 148 categories

Trend · papers per month

2505007501,000 · Jun 202019922001200920172026
48 results for convex action sets

Characterizes convex cocompact actions in projective space with dynamical properties.

problem Understanding convex cocompact group actions in projective space.
method Dynamical characterization and expansion property analysis.
result Equivalence of convex cocompactness to an expansion property in different Grassmannians.

Develops theory of relatively geometric actions on CAT(0) cube complexes.

problem Understand actions of relatively hyperbolic groups on CAT(0) cube complexes.
method Introduces and studies relatively geometric actions, proving key results.
result Proves full relatively quasi-convex subgroups are convex compact.

Study on semistable points and convexity of gradient maps for group actions.

problem Analyzing semistable points and convexity in group actions.
method Examining a real reductive group action on a Kahler manifold with Hamiltonian properties.
result Openness and connectedness of semistable points, convexity theorems for GG-action and two-orbit variety.

Algorithm minimizes loss and constraint violations in online convex optimization with smooth penalties.

problem Minimizing loss and constraint violations in online convex optimization with smooth penalties.
method Projected gradient descent over a set around the current action.
result Both dynamic regret and constraint violation are bounded by the path-length.

A theorem of Tits - Vinberg allows to build an action of a Coxeter group ΓΓ on a properly convex open set ΩΩ of the real projective space, thanks to the data PP of a polytope and reflection across its facets. We give sufficient conditions for such action to be of finite covolume, convex-cocompact or geometrically fi…

2014-08-18abs ↗pdf ↗

We achieve a finite regret bound of O(dlogd) for online inverse linear optimization with M-convex action sets.

problem Online inverse linear optimization with M-convex action sets.
method Combining structural characterization of optimal solutions on M-convex sets with geometric volume argument.
result Finite regret bound of O(dlogd) for online inverse linear optimization with M-convex action sets.

We characterize convex cocompact subgroups of the mapping class group of a surface in terms of uniform convergence actions on the zero locus of the limit set. We also construct subgroups that act as uniform convergence groups on their limit sets, but are not convex cocompact.

2007-04-19abs ↗pdf ↗

Characterizes geometric actions on graphs with flexible stabilizers.

problem Understanding geometric actions on flexible stabilizers.
method Defining generalized fine actions and proving relative quasi-convexity criteria.
result Characterizes Bowditch boundary points in relatively geometric actions.

New representation of PSL2(R) on infinite hyperbolic space via convex bodies.

problem Continuous irreducible actions of PSL2(R) on infinite-dimensional hyperbolic space.
method Using hyperbolic model for convex bodies, produce a continuous and irreducible representation.
result Yields a convex cocompact PSL2(R)-action on infinite-dimensional hyperbolic space with specific quotient properties.

Study quotients of curve complex actions by mapping class group.

problem Understanding actions of mapping class group on curve complex quotients.
method Cone off uniformly quasi-convex subspaces to form symmetric curve sets, non-maximal train track sets, and compression body disc sets. Analyze actions of mapping class group on these quotients.
result Actions of mapping class group on quotients are strongly WPD, non-elementary, and have infinite diameter.

In this paper, we show that any convex affine domain with a nonempty limit sets on the boundary under the action of the identity component of the automorphism group cannot cover a compact affine manifold with a parallel volume, which is a positive answer to the Markus conjecture for convex case. Consequently, we show t…

2018-09-21abs ↗pdf ↗

This note contains some observations on abelian convexity theorems. Convexity along an orbit is established in a very general setting using Kempf-Ness functions. This is applied to give short proofs of the Atiyah-Guillemin-Sternberg theorem and of abelian convexity for the gradient map in the case of a real analytic su…

2018-01-05abs ↗pdf ↗

This paper studies the generic behavior of kk-tuple elements for k2k\ge 2 in a proper group action with contracting elements, with applications towards relatively hyperbolic groups, CAT(0) groups and mapping class groups. For a class of statistically convex-cocompact action, we show that an exponential generic set of …

2018-12-15abs ↗pdf ↗

TRAiL is a linear bandit algorithm that ensures optimal regret and guarantees inference quality.

problem Optimal regret and inference quality in linear bandits with convex action sets.
method TRAiL estimates the parameter through regularized least squares and perturbs the action set along the tangent plane.
result TRAiL achieves an Ω(T)Ω(\sqrt{T}) upper bound on cumulative regret with high probability.

We show that the cone associated with a moment map for an action of a torus on a contact compact connected manifold is a convex polyhedral cone and that the moment map has connected fibers provided the dimension of the torus is bigger than 2 and that no orbit is tangent to the contact distribution. This may be consider…

2000-12-04abs ↗pdf ↗

New statistical convex-cocompactness found for non-orientable surfaces.

problem Understanding the dynamics of mapping class groups on non-orientable surfaces.
method Using Teichmüller space and complexity length, showing geodesics leave compact regions with exponentially low probabilities.
result Statistical convex-cocompactness of mapping class groups on non-orientable surfaces.

Abstract: Proves generic torus diffeomorphisms act parabolically and non-properly on fine curve graph and have generalized rotation sets.

problem Generic torus diffeomorphisms on fine curve graph.
method Proves generic torus diffeomorphisms act parabolically and non-properly on fine curve graph.
result Generic torus diffeomorphisms have generalized rotation sets of any point-symmetric compact convex homothety type.

Efficient algorithm converges to Nash equilibrium in bilinear problems with bandit feedback.

problem Learning dynamics in bilinear saddle-point problems with bandit feedback.
method Uncoupled learning algorithm combining experimental design and FTRL with a tailored regularizer.
result Last-iterate convergence rate of ildeO(T1/4) ilde{O}(T^{-1/4}) in high probability.

Paper proposes Vertex Networks for reinforcement learning of control systems with safety guarantees.

problem Challenges in reinforcement learning with hard state and action constraints.
method Vertex Networks incorporate safety constraints into policy network architecture, ensuring safety during exploration.
result Proposed Vertex Networks outperform vanilla reinforcement learning in benchmark control tasks.

Study Hamiltonian diffeomorphisms on symplectic manifolds and properties of invariant convex functions.

problem Properties of invariant convex functions under Hamiltonian diffeomorphisms.
method Analysis of the adjoint action and properties of invariant convex functions.
result Continuous convex functions invariant under Hamiltonian diffeomorphisms are also invariant under strict rearrangements.

We study a compact invariant convex set EE in a polar representation of a compact Lie group. Polar rapresentations are given by the adjoint action of KK on p\mathfrak{p}, where KK is a maximal compact subgroup of a real semisimple Lie group GG with Lie algebra g=kp\mathfrak{g} = \mathfrak{k} \oplus \mathfrak{p}. If …

2014-11-21abs ↗pdf ↗

We study the (relative) SL(2,C) character varieties of the three-holed projective plane and the action of the mapping class group on them. We describe a domain of discontinuity for this action, which strictly contains the set of primitive stable representations defined by Minsky, and also the set of convex-cocompact ch…

2015-09-28abs ↗pdf ↗

Anosov representations of word hyperbolic groups into higher-rank semisimple Lie groups are representations with finite kernel and discrete image that have strong analogies with convex cocompact representations into rank-one Lie groups. However, the most naive analogy fails: generically, Anosov representations do not a…

2017-01-31abs ↗pdf ↗

New algorithms optimize actions under time-varying constraints without projecting.

problem Optimizing actions under time-varying constraints without projecting.
method Projection-free algorithms using linear optimization oracle.
result Guaranteed ildeO(T3/4) ilde{O}(T^{3/4}) regret and O(T7/8)O(T^{7/8}) constraints violation.

We establish a general slice theorem for the action of a locally convex Lie group on a locally convex manifold, which generalizes the classical slice theorem of Palais to infinite dimensions. We discuss two important settings under which the assumptions of this theorem are fulfilled. First, using Glöckner's inverse fun…

2018-12-11abs ↗pdf ↗

We study generalized moment maps for a Hamiltonian action on a connected compact HH-twisted generalized complex manifold introduced by Lin and Tolman and prove the convexity and connectedness properties of the generalized moment maps for a Hamiltonian torus action.

2007-10-21abs ↗pdf ↗

New lower bound shows bandit convex optimization is harder than previously thought.

problem Establishing a lower bound on the minimax expected regret for bandit convex optimization.
method Constructing a hard class of convex functions and analyzing the posterior spread of Fisher information matrices.
result A Ω~(d5/4T)\widetildeΩ(d^{5/4}\sqrt{T}) lower bound on the minimax expected regret.

We study a notion of convex cocompactness for discrete subgroups of the projective general linear group acting (not necessarily irreducibly) on real projective space, and give various characterizations. A convex cocompact group in this sense need not be word hyperbolic, but we show that it still has some of the good pr…

2017-04-27abs ↗pdf ↗

In \cite{BK02}, M. Bonk and B. Kleiner proved a rigidity theorem for expanding quasi-Möbius group actions on Ahlfors nn-regular metric spaces with topological dimension nn. This led naturally to a rigidity result for quasi-convex geometric actions on CAT(1)(-1)-spaces that can be seen as a metric analog to the "entrop…

2013-08-02abs ↗pdf ↗

The hyperbolic space $ \H^d$ can be defined as a pseudo-sphere in the (d+1)(d+1) Minkowski space-time. In this paper, a Fuchsian group ΓΓ is a group of linear isometries of the Minkowski space such that $\H^d/Γ$ is a compact manifold. We introduce Fuchsian convex bodies, which are closed convex sets in Minkowski space, g…

2011-12-22abs ↗pdf ↗

In [GMPS] we proved that the moment map image of a bb-symplectic toric manifold is a convex bb-polytope. In this paper we obtain convexity results for the more general case of non-toric hamiltonian torus actions on bb-symplectic manifolds. The modular weights of the action on the connected components of the exceptio…

2014-12-08abs ↗pdf ↗

Optimal hidden-target learning for online inventory optimization on general convex sets.

problem Online inventory optimization (OIO) on arbitrary bounded convex capacity sets.
method Maintaining a hidden target and projecting it onto the feasible order-up-to set.
result The method improves the best known regret guarantee for OIO on general convex sets from inverse to inverse-square-root dependence on the common-demand probability.