arXiv research

Study on sets with positive reach in Euclidean and Riemannian spaces.

Study calculates reach and curvature of a specific geometric variety.

Computes bounds on reach and r-convexity from point cloud data.

Study improves understanding of submanifold reach in Riemannian geometry.

We give new characterisations of sets of positive reach and show that a closed hypersurface has positive reach if and only if it is of class $C^{1,1}$. These results are then used to prove new alternating Steiner formulæ for hypersurfaces of positive reach. Furthermore, it will turn out that every hypersurface that sat…

We determine the optimal strategy for investing in a Black-Scholes market in order to maximize the probability that wealth at death meets a bequest goal $b$, a type of goal-seeking problem, as pioneered by Dubins and Savage (1965, 1976). The individual consumes at a constant rate $c$, so the level of wealth required fo…

Various problems in manifold estimation make use of a quantity called the reach, denoted by $τ\_M$, which is a measure of the regularity of the manifold. This paper is the first investigation into the problem of how to estimate the reach. First, we study the geometry of the reach through an approximation perspective. W…

Diffusion reach probability between two nodes on a network is defined as the probability of a cascade originating from one node reaching to another node. An infinite number of cascades would enable calculation of true diffusion reach probabilities between any two nodes. However, there exists only a finite number of cas…

Current reinforcement learning (RL) algorithms can be brittle and difficult to use, especially when learning goal-reaching behaviors from sparse rewards. Although supervised imitation learning provides a simple and stable alternative, it requires access to demonstrations from a human supervisor. In this paper, we study…

The reach of a submanifold is a crucial regularity parameter for manifold learning and geometric inference from point clouds. This paper relates the reach of a submanifold to its convexity defect function. Using the stability properties of convexity defect functions, along with some new bounds and the recent submanifol…

The paper extends submanifold reach to less regular $C^{1,α}$ classes.

Study shows spheres in high dimensions have maximum volume if they are smooth and have a specific reach.

We establish a quantitative lower bound on the reach of flat norm minimizers for boundaries in $\mathbb{R}^2$.

Understanding the three-dimensional (3D) structure of the genome is essential for elucidating vital biological processes and their links to human disease. To determine how the genome folds within the nucleus, chromosome conformation capture methods such as HiC have recently been employed. However, computational methods…

We determine the optimal strategies for purchasing term life insurance and for investing in a risky financial market in order to maximize the probability of reaching a bequest goal while consuming from an investment account. We extend Bayraktar and Young (2015) by allowing the individual to purchase term life insurance…

Designing rewards for Reinforcement Learning (RL) is challenging because it needs to convey the desired task, be efficient to optimize, and be easy to compute. The latter is particularly problematic when applying RL to robotics, where detecting whether the desired configuration is reached might require considerable sup…

Two new estimators reduce costs and improve accuracy for EHR outcome prediction.

Discuss folklore statements about manifolds with curvature bounds.

The paper examines how background risk affects portfolio selection and optimal reinsurance design.

The paper explores how to measure and optimize ad reach while maintaining user privacy.

Eikonal-Constrained QRL improves goal-reaching in reinforcement learning.

Sparse reward problems are one of the biggest challenges in Reinforcement Learning. Goal-directed tasks are one such sparse reward problems where a reward signal is received only when the goal is reached. One promising way to train an agent to perform goal-directed tasks is to use Hindsight Learning approaches. In thes…

MpFL models clients as strategic players to reach equilibrium with less communication.

Recurrent neural networks (RNN) have been successfully applied to various sequential decision-making tasks, natural language processing applications, and time-series predictions. Such networks are usually trained through back-propagation through time (BPTT) which is prohibitively expensive, especially when the length o…

We consider the problem of how an individual can use term life insurance to maximize the probability of reaching a given bequest goal, an important problem in financial planning. We assume that the individual buys instantaneous term life insurance with a premium payable continuously. By contrast with Bayraktar et al. (…

In this paper, we consider three problems related to survival, growth, and goal reaching maximization of an investment portfolio with proportional net cash flow. We solve the problems in a market constrained due to borrowing prohibition. To solve the problems, we first construct an auxiliary market and then apply the d…

Autonomous agents that must exhibit flexible and broad capabilities will need to be equipped with large repertoires of skills. Defining each skill with a manually-designed reward function limits this repertoire and imposes a manual engineering burden. Self-supervised agents that set their own goals can automate this pr…

C-Learning estimates reachability over time to solve multi-goal tasks.

The economy globalization measure problem is discussed. Four macroeconomic indices of twenty among the "richest" countries are examined. Four types of "distances" are calculated.Two types of networks are next constructed for each distance measure definition. It is shown that the globalization process can be best charac…

Improves data-driven reachability estimation for complex systems.

New algorithm detects communities even with corrupted data, reaching Kesten-Stigum threshold.

Generative Adversarial Networks are a new family of generative models, frequently used for generating photorealistic images. The theory promises for the GAN to eventually reach an equilibrium where generator produces pictures indistinguishable for the training set. In practice, however, a range of problems frequently p…

We study properly immersed ancient solutions of the codimension one mean curvature flow in $n$-dimensional Euclidean space, and classify the convex hulls of the subsets of space reached by any such flow. In particular, it follows that any compact convex ancient mean curvature flow can only have a slab, a halfspace or a…

Given a sample of an abstract manifold immersed in some Euclidean space, we describe a way to recover the singular homology of the original manifold. It consists in estimating its tangent bundle -- seen as subset of another Euclidean space -- in a measure theoretic point of view, and in applying measure-based filtratio…

Processing data collected by a network of agents often boils down to solving an optimization problem. The distributed nature of these problems calls for methods that are, themselves, distributed. While most collaborative learning problems require agents to reach a common (or consensus) model, there are situations in wh…

Study finds a non-locally contractible $r$-convex set.

In important applications involving multi-task networks with multiple objectives, agents in the network need to decide between these multiple objectives and reach an agreement about which single objective to follow for the network. In this work we propose a distributed decision-making algorithm. The agents are assumed …

The Brazilian court system is currently the most clogged up judiciary system in the world. Thousands of lawsuit cases reach the supreme court every day. These cases need to be analyzed in order to be associated to relevant tags and allocated to the right team. Most of the cases reach the court as raster scanned documen…

Optimizes feature shifts for tree ensemble reclassification.

Paper improves a method for fast global and local convergence in optimization.

Extends mapping results to non-compact Riemannian manifolds with positive reach.

This paper studies the problems of vehicle make & model classification. Some of the main challenges are reaching high classification accuracy and reducing the annotation time of the images. To address these problems, we have created a fine-grained database using online vehicle marketplaces of Turkey. A pipeline is prop…

Polyak step size GD reaches final radius of convergence after log iterations.

Game theory model shows optimal investment strategy for wealth growth.

In this paper, we study the problem of escaping from saddle points in smooth nonconvex optimization problems subject to a convex set $\mathcal{C}$. We propose a generic framework that yields convergence to a second-order stationary point of the problem, if the convex set $\mathcal{C}$ is simple for a quadratic objectiv…

We determine how an individual can use life insurance to meet a bequest goal. We assume that the individual's consumption is met by an income, such as a pension, life annuity, or Social Security. Then, we consider the wealth that the individual wants to devote towards heirs (separate from any wealth related to the afor…

The recently proposed Sequence-to-Sequence (seq2seq) framework advocates replacing complex data processing pipelines, such as an entire automatic speech recognition system, with a single neural network trained in an end-to-end fashion. In this contribution, we analyse an attention-based seq2seq speech recognition syste…

The paper sets limits for GNNs solving PDEs to avoid under-reaching phenomenon.