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

4692137183 · Jun 202019922001200920172026
48 results for action decreasing

Functor connects sheaves on Lagrangian cobordisms, proving equivalence and action decreasing properties.

problem Understanding sheaf equivalences and actions on Lagrangian cobordisms.
method Analyzing sheaf quantizations and Legendrian lifts, proving functorial properties.
result Lagrangian cobordism functor is action decreasing and Morita equivalent to sheaf categories of Legendrians.

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}).

Given a closed connected Riemannian manifold M and a connected Riemannian manifold N, we study fiberwise volume decreasing diffeomorphisms on the product M x N. Our main theorem shows that in the presence of certain cohomological condition on M and N such diffeomorphisms must map a fiber diffeomorphically onto another …

2009-03-24abs ↗pdf ↗

Optimal strategy proposed for maximizing cumulative reward in continuum-armed bandits.

problem Maximizing cumulative reward in a scenario with limited resources and unknown stochastic rewards.
method Proposed an optimal strategy for a nonparametric setting with side information on actions.
result Optimal regret scales as \(O(T^{1/3})\) up to poly-logarithmic factors when \(T\) is proportional to \(N\).

The invariant measured foliations of a pseudo-Anosov homeomorphism induce a natural (singular) Sol structure on mapping tori of surfaces with pseudo-Anosov monodromy. We show that when the pseudo-Anosov φ:SSφ:S\rightarrow S has orientable foliations and does not have 1 as an eigenvalue of the induced cohomology action on…

2014-06-23abs ↗pdf ↗

Novel evolutionary strategy solves stochastic constrained optimization problems.

problem Optimizing objective functions with stochastic constraints in reinforcement learning.
method Design of a novel optimization algorithm with a sufficient decrease mechanism for stochastic constrained problems.
result Demonstrated convergence of the algorithm on control tasks and constrained optimization problems.

The paper extends a learning heuristic to high-dimensional contexts, reducing the risk of unusual actions.

problem Sequential learning problems in high dimensions, especially in dynamic pricing and auctions.
method Introducing a conservative εtε_t-greedy rule that limits the adoption of new actions to a focused set of promising actions.
result Reasonable bounds for cumulative regret and improved regret bound for conservative version compared to non-conservative.

Investment decisions shift earlier as patience decreases, with implications for pasting conditions.

problem Investment timing under decreasing impatience.
method Game-theoretic framework with continuous-time capacity expansion problem.
result Decreasing impatience leads to earlier investment decisions, but can violate smooth pasting conditions.

Characterizes a general range decreasing group homomorphism.

problem Understanding range decreasing group homomorphisms in the entire mapping group.
method Characterization of a general range decreasing group homomorphism.
result Computes a particular class of homomorphisms and identifies all range decreasing group homomorphisms on specific mapping groups.

We study the evolution of the renormalized volume functional for asymptotically Poincare-Einstein metrics (M,g) which are evolving by normalized Ricci flow. In particular, we prove that the time derivative of the renormalized volume along the flow is the negative integral of scal(g(t)) + n(n-1) over the manifold. This …

2013-07-17abs ↗pdf ↗

This paper presents a case study of a recommender system that can be used to save energy in smart homes without lowering the comfort of the inhabitants. We present an algorithm that uses consumer behavior data only and uses machine learning to suggest actions for inhabitants to reduce the energy consumption of their ho…

2015-09-18abs ↗pdf ↗

In this paper, we propose an active perception method for recognizing object categories based on the multimodal hierarchical Dirichlet process (MHDP). The MHDP enables a robot to form object categories using multimodal information, e.g., visual, auditory, and haptic information, which can be observed by performing acti…

2015-10-01abs ↗pdf ↗

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.

DRAG decreases regularization to accelerate semi-discrete OT convergence.

problem Mitigating bias in semi-discrete OT problems with entropic regularization.
method DRAG: Decreasing Regularization Averaged Gradient, a stochastic gradient descent algorithm.
result DRAG achieves unbiased O(1/t)\mathcal{O}(1/t) sample and iteration complexity for OT cost and potential estimation, and O(1/t)\mathcal{O}(1/\sqrt{t}) rate for OT map.

We discuss a special class of solutions to the minimal surface system. These are vector-valued functions that "decrease area" and are natural generalization of scalar functions. After defining area-decreasing maps, we show several classical results for the minimal surface equation can be generalized. We also conjecture…

2003-03-04abs ↗pdf ↗

Attackers can significantly reduce team rewards in cooperative multi-agent reinforcement learning.

problem Robustness of cooperative multi-agent reinforcement learning to adversaries.
method Novel attack method involving training a policy network and using targeted adversarial examples.
result Reduces team reward from 20 to 9.4 by attacking a single agent, reducing winning rate from 98.9% to 0%.

The study quantifies how many objects can be linearly classified under all views.

problem Understanding the expressivity of group-equivariant representations.
method Generalization of Cover's Function Counting Theorem to quantify separable dichotomies.
result The fraction of separable dichotomies is determined by the fixed space dimension of the group action.

Improved Bayesian regret bound for linear Thompson sampling with general distributions.

problem Proving an improved Bayesian regret bound for linear Thompson sampling with general distributions.
method Generalized elliptical potential lemma for non-Gaussian noise and prior distributions.
result Minimax optimal regret bound for changing action sets with general prior and noise distributions.

Quantum channels' contraction under privacy constraints studied.

problem Understanding the privacy constraints on quantum channel contractions.
method Established upper bounds on contraction coefficients for specific divergences under QLDP constraints.
result Upper bounds and full characterization of contraction coefficients for specific quantum distances.

We consider the mean curvature flow of the graph of a smooth map f:R2R2f:\mathbb{R}^2\to\mathbb{R}^2 between two-dimensional Euclidean spaces. If ff satisfies an area-decreasing property, the solution exists for all times and the evolving submanifold stays the graph of an area-decreasing map ftf_t. Further, we prove unifo…

2016-08-18abs ↗pdf ↗

New SAGA algorithm with decreasing step for stochastic optimization.

problem Analysis of SAGA algorithm and its convergence properties.
method Introducing a new λ-SAGA algorithm with decreasing step, investigating convergence and establishing a central limit theorem.
result Established convergence and central limit theorem for λ-SAGA algorithm.

Algorithm balances online and offline data for linear bandits.

problem Online learning with an offline dataset in linear bandits.
method Proposes a linear bandit algorithm that uses offline data early and increasingly favors exploration as the horizon grows.
result Establishes regret bounds showing competitive performance with both purely online and offline solutions.

Study geometrically characterizes piecewise circular curves with decreasing curvature.

problem Characterizing piecewise circular curves with decreasing curvature.
method Introducing moduli spaces and relating them to Legendrian polygons.
result Proves the moduli space contains a connected component homeomorphic to the Fock-Goncharov space of positive flags.

Policy gradient converges linearly with Hadamard parameterization in tabular settings.

problem Convergence of policy gradient methods under Hadamard parameterization.
method Studied convergence rate and established linear convergence after k0k_0 iterations.
result Algorithm converges linearly with rate $O( rac{1}{k})$ and faster locally after k0k_0.