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

21426283 · Jun 202019922001200920172026
48 results for non-decreasing rewards

The paper tackles rested bandits with non-decreasing and concave rewards, deriving lower bounds and an efficient algorithm.

problem Studying the sample complexity and optimal strategies for rested bandits with specific reward properties.
method Deriving regret lower bounds and designing an efficient algorithm R-ed-UCB with theoretical and empirical analysis.
result An efficient algorithm R-ed-UCB with a regret bound of O~(T23)\widetilde{\mathcal{O}}(T^{\frac{2}{3}}) under certain conditions.

Numerical observations on martingale couplings are confirmed under certain conditions.

problem Understanding the validity of numerical observations on maximizers and minimizers of martingale couplings.
method Investigation of sufficient conditions and counterexamples for the property to hold.
result The non-decreasing property of martingale couplings is preserved for maximizers under specific conditions.

Study personalizes user experience to maximize rewards with patience budget.

problem Maximizing rewards for a platform while respecting user patience.
method Proposes bandit algorithms for sequential choice with feedback models.
result Upper and lower bounds on regret of order O(N2/3)O(N^{2/3}) and Ω(N2/3)Ω(N^{2/3}).

New inequalities for convex hypersurfaces in various spaces.

problem Deriving inequalities for hypersurfaces under convex weight.
method Sharp weighted Alexandrov-Fenchel and Minkowski inequalities for smooth, closed hypersurfaces in Euclidean, spherical, and hyperbolic spaces.
result Incorporates convex, non-decreasing positive functions as weights, yielding a broad family of geometric inequalities.

It is a well-known fact that on a bounded spectral interval the Dirac spectrum can be described locally by a non-decreasing sequence of continuous functions of the Riemannian metric. In the present article we extend this result to a global version. We think of the spectrum of a Dirac operator as a function from the int…

2013-03-26abs ↗pdf ↗

We propose a global invariant σcσ_c for contact manifolds which admit a strictly pseudoconvex CR structure, analogous to the Yamabe invariant σσ. We prove that this invariant is non-decreasing under handle attaching and under connected sum. We then give a lower bound on σcσ_c in a particular case.

2018-12-04abs ↗pdf ↗

In this paper, we study the relation of the monotonicity of Hawking Mass and geometric flow problems. We show that along the Hamilton-DeTurck flow with bounded curvature coupled with the modified mean curvature flow, the Hawking mass of the hypersphere with a sufficiently large radius in Schwarzschild spaces is monoton…

2008-05-26abs ↗pdf ↗

We define an invariant of contact structures in dimension three from Heegaard Floer homology. This invariant takes values in the set Z0{}\mathbb{Z}_{\geq0}\cup\{\infty\}. It is zero for overtwisted contact structures, \infty for Stein fillable contact structures, non-decreasing under Legendrian surgery, and computable …

2016-03-08abs ↗pdf ↗

Paper analyzes convergence rates for multi-agent learning in games.

problem Convergence rates for multi-agent learning in games.
method Characterizes finite-time convergence rates for joint OGD learning on λλ-cocoercive games and develops adaptive algorithms.
result Adaptive algorithms achieve same convergence rates as non-adaptive counterparts.

We study the restless bandit associated with an extremely simple scalar Kalman filter model in discrete time. Under certain assumptions, we prove that the problem is indexable in the sense that the Whittle index is a non-decreasing function of the relevant belief state. In spite of the long history of this problem, thi…

2015-09-15abs ↗pdf ↗

We show that every non-decreasing function f ⁣:NNf\colon \mathbb N\to \mathbb N bounded from above by ana^n for some a1a\ge 1 can be realized (up to a natural equivalence) as the conjugacy growth function of a finitely generated group. We also construct a finitely generated group GG and a subgroup HGH\le G of index 2 such…

2011-07-10abs ↗pdf ↗

In this note, we study Liouville type theorem for conformal Gaussian curvature equation (also called the mean field equation) Δu=K(x)eu,inR2 -Δu=K(x)e^u, in R^2 where K(x)K(x) is a smooth function on R2R^2. When K(x)=K(x1)K(x)=K(x_1) is a sign-changing smooth function in the real line RR, we have a non-existence result for the finite to…

2008-10-29abs ↗pdf ↗

We develop a new approach to the existence of time functions on Lorentzian manifolds, based on Conley's work regarding Lyapunov functions for dynamical systems. We recover Hawking's result that a stably causal admits a time function through a more general result giving the existence of a continuous function that is non…

2016-03-22abs ↗pdf ↗

We study a simple problem that arises from the study of Lorentz surfaces and Anosov flows. For a non decreasing map of degree one h:S1S1h:\mathbb{S}^1\to \mathbb{S}^1, we are interested in groups of circle diffeomorphisms that act on the complement of the graph of hh in S1×S1\mathbb{S}^1\times \mathbb{S}^1 by preserving a vo…

2014-04-10abs ↗pdf ↗

It is conjectured that the full (spacetime) Bartnik mass of a surface ΣΣ is realised as the ADM mass of some stationary asymptotically flat manifold with boundary data prescribed by ΣΣ. Assuming this holds true for a 1-parameter family of surfaces ΣtΣ_t evolving in an initial data set {with the dominant energy condit…

2019-02-06abs ↗pdf ↗

Paper proves a generalized Alexandrov-Fenchel inequality for convex hypersurfaces with capillary boundary.

problem Proving a generalized Alexandrov-Fenchel inequality for convex hypersurfaces with capillary boundary.
method Using a locally constrained nonlinear curvature flow to preserve the nn-th quermassintegral and decrease the kk-th quermassintegral.
result Obtained the Alexandrov-Fenchel inequality for convex hypersurfaces with capillary boundary in Bn+1\mathbb{B}^{n+1}.

In this paper we obtain a splitting theorem for the symmetric diffusion operator Δφ=Δ<φ,>Δ_φ=Δ-\left<\nablaφ,\nabla \right> and a non-constant C3C^3 function ff in a complete Riemannian manifold MM, under the assumptions that the Ricci curvature associated with ΔφΔ_φ satisfies Ricφ(f,f)0{\rm Ric}_φ(\nabla f,\nabla f)\ge 0, that $|…

2015-02-01abs ↗pdf ↗

Assuming that agents' preferences satisfy first-order stochastic dominance, we show how the Expected Utility paradigm can rationalize all optimal investment choices: the optimal investment strategy in any behavioral law-invariant (state-independent) setting corresponds to the optimum for an expected utility maximizer w…

2013-02-19abs ↗pdf ↗

We describe a novel family of models of multi- layer feedforward neural networks in which the activation functions are encoded via penalties in the training problem. Our approach is based on representing a non-decreasing activation function as the argmin of an appropriate convex optimiza- tion problem. The new framewor…

2018-05-03abs ↗pdf ↗

Reward hacking exploits misspecified rewards, affecting agent capabilities and true performance.

problem Reward hacking in RL models exploiting reward misspecifications.
method Constructed four RL environments with misspecified rewards; analyzed agent capabilities and behavior.
result More capable agents exploit reward misspecifications, achieving higher proxy reward but lower true reward.

Paper introduces PRMs to learn non-Markovian stochastic rewards for reinforcement learning.

problem Lack of structured representation for non-Markovian stochastic rewards in reinforcement learning.
method Introduces probabilistic reward machines (PRMs) and presents an algorithm to learn them from decision processes.
result Algorithm proves correct and convergent for learning PRMs from decision processes.

Self-supervised reward prediction improves RL in sparse reward settings.

problem Data efficiency and sparse reward signals in reinforcement learning.
method Learning a state representation for reward prediction and using it to shape rewards.
result Self-supervised reward prediction enhances RL algorithms in single-goal environments.

The study categorizes reward errors in reinforcement learning, finding some can be beneficial.

problem Training language models with imperfect proxy rewards.
method Theoretical analysis of policy gradient optimization and categorization of reward errors.
result Reward errors can be benign or even beneficial, preventing policy from stalling.

Reward collapse occurs when ranking-based reward models yield uniform rewards for different prompts.

problem Reward collapse in aligning large language models with human preferences.
method Introduced a prompt-aware optimization scheme to derive closed-form expressions for reward distributions.
result Our prompt-aware utility functions significantly alleviate reward collapse during training.

Proposes a method to boost deep reinforcement learning with sparse rewards.

problem Challenges in learning complex behaviors with long horizons and sparse rewards.
method Predictive coding for reward shaping.
result Achieves better learning by providing reward signals that understand environment dynamics and emphasize useful features.

Action guidance helps agents learn true objectives in games with sparse rewards.

problem Training agents in games with sparse rewards requires significant exploration.
method Action guidance, a novel technique that combines exploration with reward shaping.
result Action guidance enables agents to optimize true objectives efficiently.

New RL method uses distance between states instead of rewards for sparse reward environments.

problem Sparse rewards or non-reward environments in reinforcement learning.
method Uses goal-distance gradient and bridge point planning for policy improvement.
result Significantly better performance on sparse reward and local optimal problems in complex environments.

Paper proposes RRD to learn proxy rewards for sparse delayed rewards in episodic reinforcement learning.

problem Learning from sparse and delayed rewards in reinforcement learning.
method Randomized Return Decomposition (RRD) algorithm to redistribute rewards.
result Substantial improvement over baseline algorithms in experiments.

Learning reward functions from data is a promising path towards achieving scalable Reinforcement Learning (RL) for robotics. However, a major challenge in training agents from learned reward models is that the agent can learn to exploit errors in the reward model to achieve high reward behaviors that do not correspond …

2019-11-01abs ↗pdf ↗

Enhances reward specification in RL with a novel language-based approach.

problem Reward specification in RL can lead to unintended, potentially harmful behaviours.
method Developed a novel class of language-based Reward Machines using RML's built-in memory.
result Can specify non-regular, non-Markovian reward functions for complex tasks.

Reward tweaking optimizes behavior for long-term goals by adjusting the reward function.

problem Optimizing behavior for long-term goals in reinforcement learning with unstable long planning horizons.
method Reward tweaking learns a surrogate reward function that induces optimal behavior for the original task.
result Reward tweaking guides agents towards better long-term returns while planning for short horizons.

We propose a generic, Bayesian, information geometric approach to the exploration--exploitation trade-off in multi-armed bandit problems. Our approach, BelMan, uniformly supports pure exploration, exploration--exploitation, and two-phase bandit problems. The knowledge on bandit arms and their reward distributions is su…

2018-05-04abs ↗pdf ↗

Extends reinforcement learning alignment to scalar rewards, improving math reasoning.

problem Designing reinforcement learning algorithms for general LLM alignment.
method Introduces f-GRPO and f-HAL, estimating f-divergences between reward-aligned and unaligned distributions.
result Improves math reasoning RLVR tasks and mitigates reward hacking.

This work characterizes reward function partial identifiability and its impact on policy optimization.

problem Reward function partial identifiability in complex tasks.
method Formal characterisation of partial identifiability using various reward learning data sources.
result Unified framework for comparing data sources and downstream tasks by their invariances.