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,695 papers · 148 categories

Trend · papers per month

171341512682 · Jun 202019922001200920172026
48 results for fixed time

The paper classifies fixed subgroups of endomorphisms in free-abelian times surface groups.

problem Characterizing fixed subgroups of endomorphisms in specific group structures.
method Study of endomorphisms, classification of fixed subgroups, and equivalent conditions for end-fixed subgroups.
result Complete classification of fixed subgroups in free-abelian times surface groups.

New method accelerates optimization in fixed time, improving convergence rates.

problem Optimization in large-scale data-driven problems.
method Gradient-based optimization framework with fixed-time stable dynamical systems.
result Achieves convergence to the optimizer in a fixed number of iterations, independent of initialization.

GenFlow optimizes faster, avoiding saddle points in fixed time.

problem Designing efficient optimization algorithms for convex and non-convex functions.
method Introduces GenFlow and momentum variants with fixed-time convergence guarantees.
result GenFlow and momentum variants converge to optimal solutions in fixed time for PL functions and evade saddle points uniformly.

Study geodesics entering a fixed cusp neighborhood multiple times.

problem Understanding geodesics entering a specific cusp neighborhood multiple times.
method Investigate reciprocal geodesics entering a fixed cusp neighborhood a fixed number of times.
result Characterized the class of reciprocal geodesics entering a fixed cusp neighborhood a fixed number of times.

Paper finds efficient algorithms for computing fixed points in financial networks.

problem Computing fixed points in complex financial networks with potential defaults.
method Tarski's theorem and polynomial-time algorithms for minimal and maximal fixed points.
result Efficient algorithms for computing minimal and maximal fixed points in financial networks.

A market fix serves as a benchmark for foreign exchange (FX) execution, and is employed by many institutional investors to establish an exact reference at which execution takes place. The currently most popular FX fix is the World Market Reuters (WM/R) 4pm fix. Execution at the WM/R 4pm fix is a service offered by FX b…

2015-01-30abs ↗pdf ↗

We show that every toric Sasaki-Einstein manifold SS admits a special Legendrian submanifold LL which arises as the link fix(τ)S{\rm fix}(τ)\cap S of the fixed point set fix(τ){\rm fix}(τ) of an anti-holomorphic involution ττ on the cone C(S)C(S). In particular, an irregular toric Sasaki-Einstein manifold S2×S3S^{2}\times S^{3} h…

2012-01-05abs ↗pdf ↗

Two possible definitions of fixed points in the self-similar analysis of time series are considered. One definition is based on the minimal-difference condition and another, on a simple averaging. From studying stock market time series, one may conclude that these two definitions are practically equivalent. A forecast …

1998-03-05abs ↗pdf ↗

Granger causality is a fundamental technique for causal inference in time series data, commonly used in the social and biological sciences. Typical operationalizations of Granger causality make a strong assumption that every time point of the effect time series is influenced by a combination of other time series with a…

2019-12-18abs ↗pdf ↗

New findings on complexity limits in fixed budget bandit identification.

problem Determining the best possible error rate for fixed budget bandit identification.
method Analyzing the best non-adaptive sampling procedures and showing the existence of complexities.
result No fixed complexity for certain bandit identification tasks.

EB-TCε identifies the best arm with ε confidence in stochastic bandits.

problem Identifying the best arm in stochastic bandits with a fixed level of confidence.
method EB-TCε is a novel sampling rule for ε-best arm identification in stochastic bandits.
result EB-TCε is the first anytime algorithm for fixed confidence or fixed budget identification.

Paper finds at least 6 fixed points for a specific circle action on a 10D manifold.

problem Finding the minimum number of fixed points for a circle action on a 10D almost complex manifold.
method Established a lower bound by showing the non-existence of a circle action with 4 fixed points.
result There are at least 6 fixed points for a circle action on a 10D compact almost complex manifold.

A simplified model for fixed income portfolio optimisation.

problem Modeling interest rates and credit risk in fixed income portfolios.
method Proposes a two-factor model for the time evolution of the efficient frontier.
result The efficient frontier is mainly controlled by linear constraints, with standard deviation less important.

The usual formulation of time-dependent mechanics implies a given splitting Y=R×MY=R\times M of an event space YY. This splitting, however, is broken by any time-dependent transformation, including transformations between inertial frames. The goal is the frame-covariant formulation of time-dependent mechanics on a bundle…

1997-10-04abs ↗pdf ↗

Improved AMM protocol supports diverse loan maturities in DeFi.

problem Challenges in designing AMMs for fixed-income lending with time-related complexities.
method Generalized BondMM protocol to support arbitrary maturities.
result BondMM-A protocol demonstrates superior performance in interest rate stability and financial robustness.

Study fixed-point sets of S1S^{1}-actions on quaternionic manifolds.

problem Characterize fixed-point sets and compatible complex structures on quaternionic manifolds.
method Analyze fixed-point sets and derive equations involving first Chern classes.
result Conditions for the existence of hypercomplex structures on quaternionic manifolds.

Stochastic delay differential equations (SDDE's) have been used for financial modeling. In this article, we study a SDDE obtained by the equation of a CIR process, with an additional fixed delay term in drift; in particular, we prove that there exists a unique strong solution (positive and integrable) which we call fix…

2018-06-04abs ↗pdf ↗

We study super--replication of contingent claims in markets with fixed transaction costs. This can be viewed as a stochastic impulse control problem with a terminal state constraint. The first result in this paper reveals that in reasonable continuous time financial market models the super--replication price is prohibi…

2016-10-28abs ↗pdf ↗

Deep neural networks can approximate complex functions through repeated compositions of a fixed-size ReLU network.

problem Understanding the expressive power of deep neural networks through function compositions.
method Demonstrated the surprising expressive power of repeated compositions of a single fixed-size ReLU network.
result Repeated compositions of a single fixed-size ReLU network can approximate 1-Lipschitz continuous functions on [0,1]d[0,1]^d with an error O(r1/d)\mathcal{O}(r^{-1/d}).

Paper introduces TtT, market-implied transition time, from greenium term structure.

problem Estimating market-implied transition time to a low-carbon economy.
method Develops inference theory for TtT, introduces two stochastic models.
result Combines two-layer analysis for consistent estimation of diffusion parameters.

We present cross and time series analysis of price fluctuations in the U.S. Treasury fixed income market. By means of techniques borrowed from statistical physics we show that the correlation among bonds depends strongly on the maturity and bonds' price increments do not fulfill the random walk hyphoteses.

2000-03-02abs ↗pdf ↗

Study optimal portfolio strategies with time-varying discount rates.

problem Optimizing portfolio decisions with a non-constant discount rate.
method Introduced subgame perfect strategies to handle time inconsistency, using fixed point iteration to find the utility-weighted discount rate.
result Subgame perfect strategies are equivalent to optimal strategies under certain utility function assumptions.

Many polynomial invariants of knots and links, including the Jones and HOMFLY-PT polynomials, are widely used in practice but #P-hard to compute. It was shown by Makowsky in 2001 that computing the Jones polynomial is fixed-parameter tractable in the treewidth of the link diagram, but the parameterised complexity of th…

2017-12-15abs ↗pdf ↗

We study the fillability (or embeddability) of CRCR structures under the gauge-fixed Cartan flow. We prove that if the initial CRCR structure is fillable with nowhere vanishing Tanaka-Webster curvature and free torsion, then it keeps having the same property after a short time. In the Appendix, we show the uniqueness o…

2002-02-06abs ↗pdf ↗

Paper formulates mutual information optimal control for discrete-time systems.

problem Optimal control of discrete-time linear systems with mutual information.
method Formulates MIOCP as an extension of MEOCP, derives optimal policy and prior, proposes alternating minimization algorithm.
result Proposes an alternating minimization algorithm for MIOCP.

For the product S1×S2S_1\times S_2 of any two connected compact hyperbolic surfaces S1S_1 and S2S_2, we give a finite bound B\mathcal{B} such that for any self-homeomorphism ff of S1×S2S_1\times S_2 and any fixed point class FF of ff, the index ind(f,F)B|ind(f, F)|\leq \mathcal{B}, which is an affirmative answer for a special c…

2017-08-25abs ↗pdf ↗

Gradient descent-based optimization methods underpin the parameter training of neural networks, and hence comprise a significant component in the impressive test results found in a number of applications. Introducing stochasticity is key to their success in practical problems, and there is some understanding of the rol…

2019-06-10abs ↗pdf ↗

Paper tackles time inconsistency in portfolio management with stochastic volatility and power utility.

problem Time inconsistency in portfolio management with stochastic volatility and power utility.
method Extended Hamilton Jacobi Bellman (HJB) equation, fixed point iteration, and linear parabolic PDE.
result Subgame perfect strategies are characterized and solved through numerical experiments.