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

0.3%0.5%0.8%0.7% · Nov 200419922001200920172026
30 results for Mario Bonk

We refine estimates introduced by Balogh and Bonk, to show that the boundary extensions of isometries between smooth strongly pseudoconvex domains in $\C^n$ are conformal with respect to the sub-Riemannian metric induced by the Levi form. As a corollary we obtain an alternative proof of a result of Fefferman on smooth …

2017-03-01abs ↗pdf ↗

These are problems on Heegaard splittings, that were raised at the Workshop, listed according to their contributors: David Bachman, Mario Eudave-Munoz, John Hempel, Tao Li, Yair Minsky, Yoav Moriah and Richard Weidmann. On pages 285-298 of this monograph (arxiv:0904.0017) Hyam Rubinstein gives a personal collection of …

2009-04-01abs ↗pdf ↗

We prove that, if a group is relatively hyperbolic, the parabolic subgroups are virtually nilpotent if and only if there exists a hyperbolic space with bounded geometry on which it acts geometrically finitely. This provides, by use of M. Bonk and O. Schramm embedding theorem, a very short proof of the finiteness of asy…

2004-11-19abs ↗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 ↗

We show that a closed, connected and orientable Riemannian manifold of dimension dd that admits a quasiregular mapping from Rd\mathbb R^d must have bounded cohomological dimension independent of the distortion of the map. The dimension of the degree ll de Rham cohomology of MM is bounded above by (dl)\binom{d}{l}. Thi…

2018-06-14abs ↗pdf ↗

Currently, many applications in Machine Learning are based on define new models to extract more information about data, In this case Deep Reinforcement Learning with the most common application in video games like Atari, Mario, and others causes an impact in how to computers can learning by himself with only informatio…

2019-08-16abs ↗pdf ↗

Let X be a geodesic metric space. Gromov proved that there exists k>0 such that if every sufficiently large triangle T satisfies the Rips condition with constant k times pr(T), where pr(T) is the perimeter T, then X is hyperbolic. We give an elementary proof of this fact, also giving an estimate for k. We also show tha…

2008-10-08abs ↗pdf ↗

Maps and embeddings between hyperbolic spaces and their boundaries studied.

problem Understanding relations between maps and embeddings between relatively hyperbolic spaces and their boundaries.
method Establishing correspondences between quasi-isometric embeddings and quasisymmetric embeddings, using polynomial distortion.
result Characterization of hyperbolic relative groups with polynomial distortion embeddings.

Exploration is a difficult challenge in reinforcement learning and even recent state-of-the art curiosity-based methods rely on the simple epsilon-greedy strategy to generate novelty. We argue that pure random walks do not succeed to properly expand the exploration area in most environments and propose to replace singl…

2018-07-05abs ↗pdf ↗

When a discrete group admits a convex-cocompact action on a non-compact rank-one symmetric space, there is a natural lower bound for the Hausdorff dimension of the limit set, given by the Ahlfors regular conformal dimension of the boundary of the group. We show that equality is achieved precisely when the group stabili…

2016-09-09abs ↗pdf ↗

In this paper, we focus on a prediction-based novelty estimation strategy upon the deep reinforcement learning (DRL) framework, and present a flow-based intrinsic curiosity module (FICM) to exploit the prediction errors from optical flow estimation as exploration bonuses. We propose the concept of leveraging motion fea…

2019-05-24abs ↗pdf ↗

Reinforcement learning methods require careful design involving a reward function to obtain the desired action policy for a given task. In the absence of hand-crafted reward functions, prior work on the topic has proposed several methods for reward estimation by using expert state trajectories and action pairs. However…

2018-06-02abs ↗pdf ↗

Reinforcement learning algorithms rely on carefully engineering environment rewards that are extrinsic to the agent. However, annotating each environment with hand-designed, dense rewards is not scalable, motivating the need for developing reward functions that are intrinsic to the agent. Curiosity is a type of intrins…

2018-08-13abs ↗pdf ↗

In many real-world scenarios, rewards extrinsic to the agent are extremely sparse, or absent altogether. In such cases, curiosity can serve as an intrinsic reward signal to enable the agent to explore its environment and learn skills that might be useful later in its life. We formulate curiosity as the error in an agen…

2017-05-15abs ↗pdf ↗

This paper improves level generation using VAEs for coherent, logically following segments.

problem Generating coherent levels of non-fixed length and blending levels from different games.
method Sequential segment-based level generation using VAEs with a classifier for logical placement.
result Generated levels are more coherent and capable of blending levels from different games.

We study a particular class of supersymmetric M-theory eight-dimensional non-geometric compactification backgrounds to three-dimensional Minkowski space-time, proving that the global space of the non-geometric compactification is still a differentiable manifold, although with very different geometric and topological pr…

2015-08-07abs ↗pdf ↗

CANN models improve insurance claim count predictions using telematics data.

problem Improving insurance claim count predictions with telematics data.
method Combining classical actuarial models with neural networks for telematics data.
result CANN models outperform traditional models in predicting insurance claims.