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.
The paper classifies fixed subgroups in a specific group product.
problem Classifying fixed subgroups in a specific group product.
method Complete classification through direct product analysis.
result Infinitely many fixed subgroups if and only if k ≥ 2.
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…
Let y''' = f(x, y, y', y'') be a 3rd order ODE. By Cartan equivalence method, we will study the local equivalence problem under the transformations group of time-fixed coordinates.
We show that every toric Sasaki-Einstein manifold S admits a special Legendrian submanifold L which arises as the link fix(τ)∩S of the fixed point set fix(τ) of an anti-holomorphic involution τ on the cone C(S). In particular, an irregular toric Sasaki-Einstein manifold S2×S3 h…
New algorithms improve stopping time for best arm identification.
problem Efficiently identifying the best alternative in experiments.
method Proposed algorithms with exponential-tailed stopping time.
result Proved that some algorithms never stop, leading to new methods.
Recurrent auto-encoder model summarises sequential data through an encoder structure into a fixed-length vector and then reconstructs the original sequence through the decoder structure. The summarised vector can be used to represent time series features. In this paper, we propose relaxing the dimensionality of the dec…
This paper presents some new results on Parisian ruin under Levy insurance risk process, where ruin occurs when the process has gone below a fixed level from the last record maximum, also known as the high-water mark or drawdown, for a fixed consecutive periods of time. The law of ruin-time and the position at ruin is …
Optimal reinsurance strategy with fixed cost and exponential preferences.
problem Maximizing expected utility of terminal wealth with fixed reinsurance cost.
method Two-step procedure: stochastic control and optimal stopping problem.
result Deterministic optimal strategy depends on model parameters.
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 …
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…
Paper extends BIP to nilmanifold products and characterizes fixed points.
problem Lack of Bounded Index Property for fixed points in aspherical manifolds.
method Extended BIP to iterates and proved BIP_k for nilmanifold products.
result Proved BIP_k for certain nilmanifold products.
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.
Develops variable-lag Granger causality and Transfer Entropy for time series analysis.
problem Fixed time delay assumption in Granger causality and Transfer Entropy does not hold in many applications.
method Variable-lag Granger causality and Transfer Entropy, using optimal warping path of Dynamic Time Warping (DTW).
result Proposed methods perform better than existing methods in both simulated and real-world datasets.
The paper classifies and constructs 6D GKM manifolds with 4 fixed points.
problem Classifying and constructing 6-dimensional GKM manifolds with 4 fixed points.
method Classification of GKM graphs and construction of manifolds.
result Six types of 6D GKM manifolds with 4 fixed points are identified.
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.
Causalfe estimates treatment effects in panel data with fixed effects.
problem Spurious heterogeneity in treatment effect estimates due to fixed effects in panel data.
method CFFE approach with node-level residualization during tree construction.
result Validates the estimator's performance through simulation studies.
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.
The paper proves that a specific manifold is unitary cobordant to S^2 × S^6.
problem Characterizing 8D almost complex manifolds with 4 fixed points.
method Analyzing Chern numbers and Hirzebruch χy-genus. result An 8D compact almost complex manifold with 4 fixed points is unitary cobordant to S^2 × S^6.
The study examines groups with a specific automorphism property using BNS-invariant.
problem When does a group have the finitely generated fixed subgroup property?
method Using BNS-invariant to analyze groups of the form GimesZm. result Provides partial answers and examples for groups with the property.
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×M of an event space Y. 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…
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.
APGAI identifies good arms anytime with fixed budget.
problem Identifying a good arm with a fixed sampling budget.
method An anytime algorithm for good arm identification in stochastic bandits.
result APGAI achieves efficient detection of good arms with upper bounds on probability of error and sampling complexity.
Study fixed-point sets of S1-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…
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…
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 with an error 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.
New algorithm reduces expert prediction regret for two experts.
problem Efficient prediction with two experts under fixed time constraints.
method Optimal algorithm based on stochastic calculus techniques.
result Achieves optimal regret of sqrt(T/2π) + O(1) with O(1) per-turn processing time.
New method for robust fixed-point smoothing without state augmentation.
problem Estimating initial states in Gaussian smoothing algorithms.
method Cholesky-based formulation without state augmentation.
result Matches runtime and robustness of existing methods.
According to the work of Laitinen, Morimoto, Oliver and Pawałowski, a finite group G has a smooth effective one fixed point action on some sphere if and only if G is an Oliver group. For some finite Oliver groups G of order up to 216, and for G=A5×Cn for n=3,5,7, we present a strategy of excluding o…
New algorithm speeds up knot polynomial calculations.
problem Computing Reshetikhin--Turaev knot polynomials efficiently.
method Fixed-parameter tractable computation via tensor networks.
result Knot polynomial computations are fixed-parameter tractable.
In this paper we consider the length minimizing properties of Hamiltonian paths generated by quasi-autonomous Hamiltonians on symplectically aspherical manifolds. Motivated by the work of L. Polterovich and M. Schwarz, we study the role of the fixed global extrema in the Floer complex of the generating Hamiltonian. Our…
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.
Training neural networks is hard in fixed dimensions.
problem Training two-layer neural networks is computationally hard in fixed dimensions.
method Parameterized complexity analysis considering dimension and number of neurons.
result Training two-layer neural networks is NP-hard for two dimensions.
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…
We study the fillability (or embeddability) of CR structures under the gauge-fixed Cartan flow. We prove that if the initial CR 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…
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.
ForecastNet uses a time-variant deep feed-forward neural network for better multi-step-ahead time series forecasting.
problem Time-invariant architectures limit multi-step-ahead forecasting.
method ForecastNet employs a deep feed-forward architecture with time-variant parameters and interleaved outputs.
result ForecastNet outperforms other models on multi-step-ahead time series forecasting tasks.
For the product S1×S2 of any two connected compact hyperbolic surfaces S1 and S2, we give a finite bound B such that for any self-homeomorphism f of S1×S2 and any fixed point class F of f, the index ∣ind(f,F)∣≤B, which is an affirmative answer for a special c…
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…
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.