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

107213320426 · Jun 202019922001200920172026
48 results for logarithmic partial derivative

The paper proves a logarithmic partial derivative lemma and applies it to several geometric problems.

problem Proving a logarithmic partial derivative lemma for compact Kähler manifolds.
method Developed a new ˉ\partial\bar{\partial}-type lemma for logarithmic differential forms.
result Confirmed a conjecture by X. Wan and derived several geometric applications.

New Thompson sampling algorithm for stochastic partial monitoring achieves logarithmic regret.

problem Limited feedback in sequential learning problems.
method Developed a novel Thompson-sampling-based algorithm to sample from the posterior distribution exactly.
result Achieved logarithmic regret bound of O(log T) for a linearized variant of the problem.

We present a new method to solve certain ˉ\bar{\partial}-equations for logarithmic differential forms by using harmonic integral theory for currents on Kahler manifolds. The result can be considered as a ˉ\bar{\partial}-lemma for logarithmic forms. As applications, we generalize the result of Deligne about closedness…

2017-07-31abs ↗pdf ↗

The Seiberg-Witten family of elliptic curves defines a Jacobian rational elliptic surface Z\Z over CP1\mathbb{C}\mathrm{P}^1. We show that for the ˉ\bar{\partial}-operator along the fiber the logarithm of the regularized determinant 1/2logdet(ˉˉ)-1/2 \log \det' (\bar\partial^* \bar\partial) satisfies the anomaly equation of the …

2008-02-11abs ↗pdf ↗

The question addressed in this paper is the performance of the optimal strategy, and the impact of partial information. The setting we consider is that of a stochastic asset price model where the trend follows an unobservable Ornstein-Uhlenbeck process. We focus on the optimal strategy with a logarithmic utility functi…

2015-10-13abs ↗pdf ↗

The paper constructs a Saito basis for a specific class of divisors and applies it to logarithmic Poisson geometry.

problem Investigating a class of non-quasi-homogeneous free divisors and their logarithmic vector fields.
method Explicitly constructing a Saito basis for the module of logarithmic vector fields and applying it to logarithmic Poisson geometry.
result The construction of the Saito basis and the Lie-Rinehart algebra structure on the sheaf of logarithmic 1-forms.

The paper studies a 1D diffusion equation with nonlinear Robin boundary conditions and finds conditions for global and finite time blow-up or blow-down.

problem Investigating the behavior of solutions to a specific diffusion equation with nonlinear Robin boundary conditions.
method Analyzing the Ricci flow on a cylinder and applying it to the diffusion equation.
result Conditions for global and finite time blow-up or blow-down of solutions.

We study utility maximization problem for general utility functions using dynamic programming approach. We consider an incomplete financial market model, where the dynamics of asset prices are described by an RdR^d-valued continuous semimartingale. Under some regularity assumptions we derive backward stochastic partial…

2008-06-02abs ↗pdf ↗

AdaptOn achieves logarithmic regret in adaptive control of unknown partially observable linear systems.

problem Adaptive control in partially observable linear dynamical systems.
method AdaptOn algorithm that estimates system dynamics through online learning and gradient descent.
result AdaptOn achieves a logarithmic regret bound of polylog(T) after T steps.

New Thompson Sampling for partially observed context bandits reduces regret logarithmically with time.

problem Improving Thompson Sampling for partially observed context bandits.
method Proposed a Thompson Sampling algorithm for partially observable contextual multi-armed bandits with theoretical performance guarantees.
result Regret scales logarithmically with time and the number of arms, and linearly with the dimension.

Study optimal policy regret in partially observable Markov games with adaptive opponents.

problem Optimal sequential decision-making in partially observable environments against strategic, adaptive opponents.
method An epoch-based optimistic maximum-likelihood algorithm that selects one policy per epoch using confidence sets built cumulatively from past data.
result Achieves ildeO(T) ilde{O}(\sqrt{T}) policy regret for fixed problem parameters, with explicit dependence on horizon, adversary memory, confidence radius, and aggregate Eluder dimension.

New method uses sparse deep neural networks for high-dimensional regression with improved parameter estimation.

problem Improving parameter estimation in high-dimensional sparse regression models.
method Proposes nonparametric estimation of partial derivatives in sparse deep neural networks.
result Established convergence rate of nonparametric estimation of partial derivatives as O(n1/4)\mathcal{O}(n^{-1/4}).

The paper proves curvature rigidity for manifolds with specific scalar curvature bounds.

problem Curvature rigidity of manifolds with scalar curvature constraints.
method Power series expansions of logarithmic Sobolev and W-functionals, scalar curvature bounds, and isoperimetric profiles.
result The sectional curvature of a manifold is constant (K) if it satisfies scalar curvature and isoperimetric conditions.

Improved ExO method achieves near-optimal bounds in both stochastic and adversarial settings.

problem Finding optimal exploration strategies in online decision-making with limited feedback.
method Exploration by Optimization with hybrid regularizers for locally observable games.
result Achieved nearly optimal bounds of O(aeqak2m2logT/Δa)O(\sum_{a eq a^*} k^2 m^2 \log T / Δ_a) in stochastic and adversarial environments.

We present a new anytime algorithm that achieves near-optimal regret for any instance of finite stochastic partial monitoring. In particular, the new algorithm achieves the minimax regret, within logarithmic factors, for both "easy" and "hard" problems. For easy problems, it additionally achieves logarithmic individual…

2012-06-27abs ↗pdf ↗

Logarithmic connections on principal bundles over normal varieties are studied.

problem Existence and properties of logarithmic connections on principal bundles over normal varieties.
method Introducing logarithmic connections, showing equivalence to covariant derivatives, and proving existence conditions.
result Existence of logarithmic connections on principal bundles over normal varieties is equivalent to certain conditions on the associated vector bundles and adjoint bundles.

First, classes of Markov processes that scale exactly with a Hurst exponent H are derived in closed form. A special case of one class is the Tsallis density, advertised elsewhere as nonlinear diffusion or diffusion with nonlinear feedback. But the Tsallis model is only one of a very large class of linear diffusion with…

2006-06-05abs ↗pdf ↗

Uniform heat kernel and diffusion bridge asymptotics for sub-Riemannian geometry.

problem Analyzing sub-Riemannian heat kernels and their derivatives on incomplete manifolds.
method Localized asymptotic analysis, focusing on minimizing geodesics and the non-abnormal cut locus.
result Uniform bounds and expansions for heat kernels and their derivatives on compacts, including the diffusion bridge measure.

In this work, we give a formula for the logarithmic invariant of knots in terms of certain derivatives of the colored Jones invariant. This invariant is related to the logarithmic conformal field theory, and was defined by using the centers in the radical of the restricted quantum group at root of unity. A relation bet…

2014-06-05abs ↗pdf ↗

This paper studies the problem of inferring a global preference based on the partial rankings provided by many users over different subsets of items according to the Plackett-Luce model. A question of particular interest is how to optimally assign items to users for ranking and how many item assignments are needed to a…

2014-06-21abs ↗pdf ↗

We show that our generalization of the Black-Scholes partial differential equation (pde) for nontrivial diffusion coefficients is equivalent to a Martingale in the risk neutral discounted stock price. Previously, this was proven for the case of the Gaussian logarithmic returns model by Harrison and Kreps, but we prove …

2006-06-01abs ↗pdf ↗

Characterizes the local diffeomorphism structure of the exponential in the set of skew-symmetric matrices.

problem Characterizing the local diffeomorphism structure of the exponential in the set of skew-symmetric matrices.
method Introduce the diffeomorphic logarithm of special orthogonal matrices and an efficient algorithm.
result The region containing the principal logarithm has a special multiplicity structure.

Derives gradient estimate for a specific nonlinear parabolic equation on Finsler manifolds.

problem Derives gradient estimate for a nonlinear parabolic equation on Finsler manifolds.
method Leverages a new Laplacian comparison theorem to derive a Li-Yau type gradient estimate.
result Establishes a Li-Yau type gradient estimate for the Finslerian logarithmic Schrödinger equation.

Study excess logarithmic residues for foliations to bound invariant hypersurfaces and test log canonicity.

problem Bounding invariant hypersurfaces and testing log canonicity of singularities.
method Introduce excess logarithmic residues, prove residue formula, derive Poincaré-type bound, and use them to recover log discrepancies.
result Componentwise logarithmic residues of a lifted foliation along the exceptional divisor recover log discrepancies of singularities.

The paper optimizes portfolios using MACD signals derived from price history.

problem Optimizing risky asset portfolios with latent mean-reverting and momentum factors.
method Derives optimal strategies based on MACD signals from EMA processes.
result Establishes admissibility and verification of optimal strategies.

We generalize Cartan's logarithmic derivative of a smooth map from a manifold into a Lie group GG to smooth maps into a homogeneous space M=G/HM=G/H, and determine the global monodromy obstruction to reconstructing such maps from infinitesimal data. The logarithmic derivative of the embedding of a submanifold $Σ\subset M…

2017-02-09abs ↗pdf ↗

Study of conformal logarithmic Laplacian on sphere, connecting Yamabe problems and Sobolev spaces.

problem Yamabe-type problems and Sobolev spaces on the sphere.
method Detailed spectral analysis, conformal invariance, and Hilbert space introduction.
result Established precise connection between sphere and \(\mathbb{R}^N\) logarithmic Laplacian.

Logarithmic regret for continuous-time reinforcement learning.

problem Continuous-time Markov decision processes with unknown transition probabilities and holding times.
method Upper confidence reinforcement learning, mean holding time estimation, stochastic comparison of point processes.
result Logarithmic regret bound achieved in finite time.

Partial monitoring is a rich framework for sequential decision making under uncertainty that generalizes many well known bandit models, including linear, combinatorial and dueling bandits. We introduce information directed sampling (IDS) for stochastic partial monitoring with a linear reward and observation structure. …

2020-02-25abs ↗pdf ↗

Logarithmic corrections to Price's law near black hole event horizon.

problem Failure of smooth null infinity in black hole spacetimes.
method Analyzing linear wave equation on Schwarzschild background with specific initial conditions.
result Leading-order asymptotics of solutions near future null infinity and event horizon are logarithmically modified.

Deep networks can efficiently approximate functions on curved manifolds.

problem Approximating functions and their derivatives on complex, curved domains.
method Proved constant-depth ReLU networks can approximate functions in Sobolev spaces on manifolds.
result Deep networks with bounded weights can approximate functions in Wpk(Md)\mathcal{W}_p^{k}(\mathcal{M}^d) to an error of ε\varepsilon using O(εd/(ks))\mathcal{O}(\varepsilon^{-d/(k-s)}) parameters.

The paper challenges the smooth null infinity model by constructing counter-examples and showing non-smoothness of null infinity.

problem The structure of gravitational radiation near infinity, particularly at smooth null infinity.
method Constructing solutions to the spherically symmetric Einstein-Scalar field equations and analyzing asymptotic behavior.
result The asymptotic expansion of the derivative of the scalar field near null infinity contains logarithmic terms, indicating non-smoothness.

We prove Bismut-type formulae for the first and second derivatives of a Feynman-Kac semigroup on a complete Riemannian manifold. We derive local estimates and give bounds on the logarithmic derivatives of the integral kernel. Stationary solutions are also considered. The arguments are based on local martingales, althou…

2016-11-14abs ↗pdf ↗