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

3887751,1631,550 · Jun 202019922001200920172026
48 results for static model parameters

We classify static manifolds which admit more than one static decomposition whenever a condition on the curvature is fullfilled. For this, we take a standard static vector field and analyze its associated one parameter family of projections onto the base. We show that the base itself is a static manifold and the warpin…

2009-10-26abs ↗pdf ↗

New method uses transport maps for efficient Bayesian inference.

problem Efficiently perform sequential Bayesian inference of static model parameters.
method Estimation of structured transport maps to extract conditional distributions.
result Gradient-based characterization of posterior density for online parameter estimation.

Paper defines Bartnik mass for hyperbolic extensions and proves staticity.

problem Defining and proving staticity of asymptotically hyperbolic minimal mass extensions.
method Definition of Bartnik mass, construction of metrics, one-parameter family analysis.
result Static potential for asymptotically hyperbolic admissible extensions achieving Bartnik mass.

The paper proves a geometric capacitary inequality for sub-static manifolds with harmonic potentials.

problem Proving a geometric capacitary inequality for sub-static manifolds with harmonic potentials.
method Introducing a one-parameter family of functions that are monotone along the level-set flow of the potential, up to the optimal threshold.
result Proves a geometric capacitary inequality where the capacity of the horizon plays the same role as the ADM mass in the celebrated Riemannian Penrose Inequality.

Investigates fund separations and stability for long-term optimal investments.

problem Optimizing long-term investments in an incomplete market with risky and safe assets.
method Analyzes three market models with different state variable processes to find optimal portfolios and prove convergence stability.
result Dynamic optimal portfolios converge to static portfolios over time, with vanishing sensitivities in the long run.

Network sampling is integral to the analysis of social, information, and biological networks. Since many real-world networks are massive in size, continuously evolving, and/or distributed in nature, the network structure is often sampled in order to facilitate study. For these reasons, a more thorough and complete unde…

2012-11-14abs ↗pdf ↗

In many practical applications of clustering, the objects to be clustered evolve over time, and a clustering result is desired at each time step. In such applications, evolutionary clustering typically outperforms traditional static clustering by producing clustering results that reflect long-term trends while being ro…

2011-04-11abs ↗pdf ↗

We consider a multi-armed bandit problem in a setting where each arm produces a noisy reward realization which depends on an observable random covariate. As opposed to the traditional static multi-armed bandit problem, this setting allows for dynamically changing rewards that better describe applications where side inf…

2011-10-27abs ↗pdf ↗

We present a simple model that uses time series momentum in order to construct strategies that systematically outperform their benchmark. The simplicity of our model is elegant: We only require a benchmark time series and several related investable indizes, not requiring regression or other models to estimate our param…

2020-02-11abs ↗pdf ↗

Novel framework optimizes experiments for implicit models using mutual information.

problem Optimizing experiments for intractable implicit models.
method Sequential Bayesian Experimental Design using Mutual Information.
result Framework efficiently estimates parameters with few iterations.

New research shows fixed-budget best-arm identification cannot match static oracle performance.

problem Fixed-budget best-arm identification's performance limitations.
method Analysis of various adaptive and static algorithms for best-arm identification.
result For any algorithm, there exists at least one instance where the error decay rate is at most \((1 + \frac{\log(K)}{8})^{-1}\) times that of the static oracle.

Model-based collaborative filtering analyzes user-item interactions to infer latent factors that represent user preferences and item characteristics in order to predict future interactions. Most collaborative filtering algorithms assume that these latent factors are static, although it has been shown that user preferen…

2016-08-17abs ↗pdf ↗

We consider a continuous-time financial market that consists of securities available for dynamic trading, and securities only available for static trading. We work in a robust framework where a set of non-dominated models is given. The concept of semi-static completeness is introduced: it corresponds to having exact re…

2015-10-07abs ↗pdf ↗

We develop a model for indifference pricing in derivatives markets where price quotes have bid-ask spreads and finite quantities. The model quantifies the dependence of the prices and hedging portfolios on an investor's beliefs, risk preferences and financial position as well as on the price quotes. Computational techn…

2018-03-07abs ↗pdf ↗

This paper considers mean-variance optimization under uncertainty, specifically when one desires a sparsified set of optimal portfolio weights. From the standpoint of a Bayesian investor, our approach produces a small portfolio from many potential assets while acknowledging uncertainty in asset returns and parameter es…

2015-12-08abs ↗pdf ↗

Study analyzes Echo State Network parameters for Rossler attractor dynamics.

problem Understanding the influence of network type on Echo State Network performance.
method Experimental analysis of Echo State Network parameters using Rossler attractor.
result Exploration of how network type affects Echo State Network performance.

Graph neural networks predict solid-state NMR parameters from atomic structures.

problem Efficiently predicting NMR parameters from atomic structures for complex materials.
method Graph neural networks applied to tensor quantities for anisotropic magnetic shielding and electric field gradient.
result Improved accuracy in predicting NMR properties from diverse and complex materials.

Investigates model risk and semi-static hedging for martingale constrained models.

problem Model risk distributionally robust sensitivities for functionals on the Wasserstein space.
method Introduces distributionally robust problem with semi-static hedging strategies.
result Explicit characterizations of model risk optimal semi-static hedging strategies.

The Ryu-Takayanagi conjecture connects the entanglement entropy in the boundary CFT to the area of open co-dimension two minimal surfaces in the bulk. Especially in AdS(4), the latter are two-dimensional surfaces, and, thus, solutions of a Euclidean non-linear sigma model on a symmetric target space that can be reduced…

2016-12-12abs ↗pdf ↗

We consider hedging of a contingent claim by a 'semi-static' strategy composed of a dynamic position in one asset and static (buy-and-hold) positions in other assets. We give general representations of the optimal strategy and the hedging error under the criterion of variance-optimality and provide tractable formulas u…

2017-09-16abs ↗pdf ↗

Using generating functional and replica techniques, respectively, we study the dynamics and statics of a spherical Minority Game (MG), which in contrast with a spherical MG previously presented in J.Phys A: Math. Gen. 36 11159 (2003) displays a phase with broken ergodicity and dependence of the macroscopic stationary s…

2005-08-18abs ↗pdf ↗

Wider neural networks perform better than deeper ones with the same number of parameters.

problem Understanding the role of network width versus the number of parameters in neural network performance.
method Comparing models with different ways of increasing width while keeping the number of parameters constant, analyzing their performance and using Gaussian Process kernels for analysis.
result Network width is the determining factor for good performance, while the number of weights is secondary as long as trainability is ensured.

Study classifies static potentials on 3-manifolds, proving one-dimensionality under specific conditions.

problem Classifying the dimension of static potentials on 3-manifolds.
method Analysis of relative zero sets of static potentials, using Miao and Tam's technique.
result Proves one-dimensionality of static potentials under specific conditions.

Develops a hedging method for multi-asset derivatives with correlation risk.

problem Hedging multi-asset derivatives exposed to correlation and covariance risk.
method Combines dynamic trading with static hedging instruments using Galtchouk--Kunita--Watanabe decomposition.
result Explicit semi-static replication formulas for covariance swaps and geometric dispersion trades.

New static vacuum metrics confirmed for near Euclidean boundary data.

problem Establishing sufficient conditions for near Euclidean boundary data in static vacuum metrics.
method Using new arguments from studying the conjecture for arbitrary static vacuum metrics.
result Any hypersurface in a dense subfamily is static regular.

Paper presents a machine learning algorithm for hedging ETF options, outperforming static hedging methods.

problem Semi-static hedging of ETF options with transaction costs and varying market conditions.
method Data-driven machine learning algorithm considering transaction costs, automated portfolio management, and PnL attribution analysis.
result The static hedging approach outperforms dynamic hedging methods in terms of profit and loss.

The paper explores rigidity and splitting theorems for sub-static spaces with minimal hypersurfaces.

problem Rigidity and splitting problems for sub-static systems with boundary.
method Local and global splitting theorems, boundary integral inequalities, Liouville theorem.
result Improvements in rigidity and splitting results for sub-static spaces, including vacuum and non-vacuum cases.

The parameters of temporal models, such as dynamic Bayesian networks, may be modelled in a Bayesian context as static or atemporal variables that influence transition probabilities at every time step. Particle filters fail for models that include such variables, while methods that use Gibbs sampling of parameter variab…

2013-05-08abs ↗pdf ↗

In this paper, we argue that, once the costs of maintaining the hedging portfolio are properly taken into account, semi-static portfolios should more properly be thought of as separate classes of derivatives, with non-trivial, model-dependent payoff structures. We derive new integral representations for payoffs of exot…

2019-02-07abs ↗pdf ↗

Knowledge graphs (KGs) typically contain temporal facts indicating relationships among entities at different times. Due to their incompleteness, several approaches have been proposed to infer new facts for a KG based on the existing ones-a problem known as KG completion. KG embedding approaches have proved effective fo…

2019-07-06abs ↗pdf ↗

Extends static vacuum metrics with specific boundary conditions.

problem Proving the existence of static vacuum metrics with prescribed boundary data.
method Introducing static regular types (I) and (II), showing local well-posedness, and confirming Bartnik's conjecture.
result Confirms Bartnik's static vacuum extension conjecture for a broad range of boundary conditions.

Two algorithms for linear contextual bandits with rare updates achieve optimal regret and efficiency.

problem Linear contextual bandits with infrequent parameter updates.
method Two practical algorithms with O(loglogT)O(\log\log T) updates, BLCE-G and BLCE.
result Minimax-optimal regret with low computational complexity.

Explicit models for the restricted conformal group of the Einstein static universe of dimension greater than two and for its universal covering group are constructed. Based on these models, as an application we determine all oriented and time-oriented conformal Lorentz manifolds whose restricted conformal group has max…

2019-09-18abs ↗pdf ↗

A new method for efficient neural network fine-tuning using queryable low-rank update atoms.

problem Rigidity of static low-rank adaptation methods when input and depth-wise computation vary.
method A shared queryable memory of low-rank update atoms, allowing dynamic and context-sensitive adaptation.
result Improves final test performance and training stability compared to standard low-rank adaptation.

Geometric inequalities for static convex domains in hyperbolic space proved.

problem Proving geometric inequalities for static convex domains in hyperbolic space.
method Using static convexity of flow hypersurfaces, new inequalities are derived.
result New family of geometric inequalities for static convex domains in hyperbolic space.

The paper classifies vacuum static spaces with harmonic curvature.

problem Classifying vacuum static spaces with harmonic curvature.
method Extending the 4-dimensional work by Kim-Shin, the paper classifies nn-dimensional spaces (n5n\geq 5).
result New counterexamples to the Fischer-Marsden conjecture on compact vacuum static spaces.