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.
Proposes SOR Q-learning for faster optimal value function computation in RL.
Proposes a faster second-order method for MDPs.
The framework of Integral Quadratic Constraints of Lessard et al. (2014) reduces the computation of upper bounds on the convergence rate of several optimization algorithms to semi-definite programming (SDP). Followup work by Nishihara et al. (2015) applies this technique to the entire family of over-relaxed Alternating…
The framework of Integral Quadratic Constraints (IQC) reduces the computation of upper bounds on the convergence rate of several optimization algorithms to a semi-definite program (SDP). In the case of over-relaxed Alternating Direction Method of Multipliers (ADMM), an explicit and closed form solution to this SDP was …
In this paper we present qualitative and quantitative comparison of various analytical and numerical approximation methods for calculating a position of the early exercise boundary of the American put option paying zero dividends. First we analyze their asymptotic behavior close to expiration. In the second part of the…
This paper studies the optimal VIX futures trading problems under a regime-switching model. We consider the VIX as mean reversion dynamics with dependence on the regime that switches among a finite number of states. For the trading strategies, we analyze the timings and sequences of the investor's market participation,…
This paper deals with pricing of European and American options, when the underlying asset price follows Heston model, via the interior penalty discontinuous Galerkin finite element method (dGFEM). The advantages of dGFEM space discretization with Rannacher smoothing as time integrator with nonsmooth initial and boundar…
We propose and analyze a constrained level-set method for semi-automatic image segmentation. Our level-set model with constraints on the level-set function enables us to specify which parts of the image lie inside respectively outside the segmented objects. Such a-priori information can be expressed in terms of upper a…
In this paper we investigate a nonlinear generalization of the Black-Scholes equation for pricing American style call options in which the volatility term may depend on the underlying asset price and the Gamma of the option. We propose a numerical method for pricing American style call options by means of transformatio…
Statistical image reconstruction (SIR) methods are studied extensively for X-ray computed tomography (CT) due to the potential of acquiring CT scans with reduced X-ray dose while maintaining image quality. However, the longer reconstruction time of SIR methods hinders their use in X-ray CT in practice. To accelerate st…
In real-world applications, not all instances in multi-view data are fully represented. To deal with incomplete data, Incomplete Multi-view Learning (IML) rises. In this paper, we propose the Joint Embedding Learning and Low-Rank Approximation (JELLA) framework for IML. The JELLA framework approximates the incomplete d…
Chebyshev steps improve convergence in deep-unfolded gradient descent.
A learning algorithm optimizes SOR solver parameters for a sequence of linear systems efficiently.
New algorithm improves tensor completion performance.
When solving consensus optimization problems over a graph, there is often an explicit characterization of the convergence rate of Gradient Descent (GD) using the spectrum of the graph Laplacian. The same type of problems under the Alternating Direction Method of Multipliers (ADMM) are, however, poorly understood. For i…
RTC-GTNLN model recovers traffic data from missing values and noise.
Extends positive and almost positive links to successively almost positive ones.
Success conditioning optimizes policies by imitating successful trajectories, solving a trust-region optimization problem.
New metrics solve machine learning limitations.
Paper proposes a new tensor imputation method for spatiotemporal traffic data with missing patterns.
Machine learning predicts TV show success based on factors like characters and direction.
We review recent numerical results on the role of talent and luck in getting success by means of a schematic agent-based model. In general the role of luck is found to be very relevant in order to get success, while talent is necessary but not sufficient. Funding strategies to improve the success of the most talented p…
Predicting startup success using Crunchbase data and deep learning.
Enhances VC startup success predictions using graph augmented time series models.
Proposes a new framework to manage venture capital portfolio risk by focusing on deal-level correlations.
A new method predicts student skill success rates in real-time.
Study predicts success of crypto-tokens on Pump.fun platform.
Study shows startup competition and investor network influence fundraising success at different stages.
New method forecasts workforce reintegration success rates.
New bounds on AE success probability in GP models.
The paper defines successful active management and introduces a framework.
We study the problem of identifying the top arms in a multi-armed bandit game. Our proposed solution relies on a new algorithm based on successive rejects of the seemingly bad arms, and successive accepts of the good ones. This algorithmic contribution allows to tackle other multiple identifications settings that w…
Vanguard uses AI to create personalized financial plans.
Paper proposes a new method for training nonconvex models.
The muti-layer information bottleneck (IB) problem, where information is propagated (or successively refined) from layer to layer, is considered. Based on information forwarded by the preceding layer, each stage of the network is required to preserve a certain level of relevance with regards to a specific hidden variab…
We consider the problem of learning from sparse and underspecified rewards, where an agent receives a complex input, such as a natural language instruction, and needs to generate a complex response, such as an action sequence, while only receiving binary success-failure feedback. Such success-failure rewards are often …
In this paper, we propose a new fast and robust recursive algorithm for near-separable nonnegative matrix factorization, a particular nonnegative blind source separation problem. This algorithm, which we refer to as the successive nonnegative projection algorithm (SNPA), is closely related to the popular successive pro…
Study of new link types and their invariants, extending previous results.
System recommends workouts and predicts success rates using RNNs.
The paper introduces SuccessProbaMax to optimize policy success probability in online advertising.
To a compact Riemann surface of genus g can be assigned a principally polarized abelian variety (PPAV) of dimension g, the Jacobian of the Riemann surface. The Schottky problem is to discern the Jacobians among the PPAVs. Buser and Sarnak showed, that the square of the first successive minimum, the squared norm of the …
PixelHop uses SSL for image classification, outperforming CNN.
Using the trends of estimated abilities in terms of item response theory for online testing, we can predict the success/failure status for the final examination to each student at early stages in courses. In prediction, we applied the newly developed nearest neighbor method for determining the similarity of learning sk…
GRPO optimizes LLMs with verifiable rewards, amplifying policy success.
A successful grasp requires careful balancing of the contact forces. Deducing whether a particular grasp will be successful from indirect measurements, such as vision, is therefore quite challenging, and direct sensing of contacts through touch sensing provides an appealing avenue toward more successful and consistent …
Bias is essential for machine learning success, quantifiable and conserved.
Develops a fair post-processing method for student success predictions.
We present a simple and general result that the sign of the variations or increments of uncorrelated times series are predictable with a remarkably high success probability of 75% for symmetric sign distributions. The origin of this paradoxical result is explained in details. We also present some tests on synthetic, fi…