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

Trend · papers per month

2356 · Feb 202619922001200920172026
48 results for golden ladder

Study on CR-lightlike submanifolds in golden semi-Riemannian manifolds.

problem Exploring properties of CR-lightlike submanifolds in golden semi-Riemannian manifolds.
method Definition and investigation of properties of geodesic CR-submanifolds.
result Obtained results for totally geodesic and totally umbilical CR-submanifolds.

In this paper, we study slant submanifolds of Riemannian manifolds with Golden structure. A Riemannian manifold (M~,g~,φ)(\tilde{M},\tilde{g},{\varphi}) is called a Golden Riemannian manifold if the (1,1)(1,1) tensor field φ{\varphi} on M~\tilde{M} is a golden structure, that is φ2=φ+I{\varphi}^{2}={\varphi}+I and the metric $\tild…

2018-04-30abs ↗pdf ↗

Mack's estimator improves chain ladder prediction for large exposure insurance models.

problem Uncertainty quantification in compound Poisson loss models.
method Large exposure asymptotics applied to Mack's estimator.
result Chain ladder prediction uncertainty can be quantified without model assumptions.

The Golden Ratio is fascinating topic that continually generated news ideas. A Riemannian manifold endowed with a Golden Structure will be called a Golden Riemannian manifold. The main purpose of the present paper is to study the geometry of radical transversal lightlike submanifolds and transversal lightlike submanifo…

2018-04-10abs ↗pdf ↗

The abstract introduces golden Finsler structures and explores their local and global properties.

problem Investigating geometric properties of golden Finsler structures.
method Local and global analysis of golden Finsler structures, including explicit computations and transformations.
result Proved that golden Finsler structures cannot be projectively related.

In this work, almost product and almost golden structures are studied. Conditions for those structures being Integrable and parallel are investigated. Also harmonicity of a map between almost pruduct or almost golden manifolds with pure or hyperbolic metric is discussed under certain conditions.

2016-12-22abs ↗pdf ↗

We examine spaces of connected tri-/univalent graphs subject to local relations which are motivated by the theory of Vassiliev invariants. It is shown that the behaviour of ladder-like subgraphs is strongly related to the parity of the number of rungs: there are similar relations for ladders of even and odd lengths, re…

2003-01-03abs ↗pdf ↗

Study gluing of Lorentzian length spaces and their causal ladder properties.

problem Compatibility of Lorentzian amalgamation with length space properties.
method Conditions for gluing Lorentzian length spaces and criteria for causal ladder preservation.
result Gluing of Lorentzian length spaces yields again a Lorentzian length space under certain conditions.

The aim of our paper is to focus on some properties of hemi-slant submanifolds in metallic (and Golden) Riemannian manifolds. We give some characterizations for submanifolds to be hemi-slant submanifolds in metallic (or Golden) Riemannian manifolds and we obtain integrability conditions for the distributions involved. …

2018-04-14abs ↗pdf ↗

We used the Ladder Network [Rasmus et al. (2015)] to perform Hyperspectral Image Classification in a semi-supervised setting. The Ladder Network distinguishes itself from other semi-supervised methods by jointly optimizing a supervised and unsupervised cost. In many settings this has proven to be more successful than o…

2018-12-04abs ↗pdf ↗

The aim of our paper is to focus on some properties of slant and semi-slant submanifolds of metallic Riemannian manifolds. We give some characterizations for submanifolds to be slant or semi-slant submanifolds in metallic or Golden Riemannian manifolds and we obtain integrability conditions for the distributions involv…

2018-03-08abs ↗pdf ↗

Semi-supervised learning (SSL) partially circumvents the high cost of labeling data by augmenting a small labeled dataset with a large and relatively cheap unlabeled dataset drawn from the same distribution. This paper offers a novel interpretation of two deep learning-based SSL approaches, ladder networks and virtual …

2017-11-20abs ↗pdf ↗

New ladder methods improve numerical accuracy in parallel transport on manifolds.

problem Lack of convergence analysis for ladder schemes on manifolds.
method Taylor approximations and iterative constructions of geodesic parallelograms.
result Ladder methods converge quadratically with quadratic speed.

An almost Golden Riemannian structure (φ,g)(\varphi ,g) on a manifold is given by a tensor field φ\varphi of type (1,1) satisfying the Golden section relation φ2=φ+1\varphi ^{2}=\varphi +1, and a pure Riemannian metric gg, i.e., a metric satisfying g(φX,Y)=g(X,φY)g(\varphi X,Y)=g(X,\varphi Y). We study connections adapted to such a str…

2017-04-04abs ↗pdf ↗

The paper finds pseudo-Anosov-like maps on an infinite ladder surface.

problem Exploring dynamics on infinite surfaces.
method Lifts Penner-type pseudo-Anosov maps from a closed surface to an infinite ladder surface.
result Existence and properties of pseudo-Anosov-like maps on the infinite ladder surface.

We briefly review selected contributions to immersion-theoretic topology, from S. Smale's immersion theory for spheres to M. Gromov's convex integration theory, during the early "golden" period from about 1959-1973. Historical remarks are included and technical concepts are presented informally.

2003-07-09abs ↗pdf ↗

The paper proposes incentivizing human annotators with 'golden questions' to improve data quality.

problem Ensuring high-quality human annotations for training large language models.
method A principal-agent model is used to incentivize annotators with bonuses based on the maximum likelihood estimators (MLE) of their annotations. Hypothesis testing is applied to monitor the annotators' performance.
result The hypothesis testing rate for the principal-agent model is of Θ(1/nlogn)Θ(1/\sqrt{n \log n}), highlighting the importance of 'golden questions' for monitoring annotators.

In this paper, we study the existence of proper warped product submanifolds in metallic (or Golden) Riemannian manifolds and we discuss about semi-invariant, semi-slant and, respectively, hemi-slant warped product submanifolds in metallic and Golden Riemannian manifolds. Also, we provide some examples of warped product…

2018-06-22abs ↗pdf ↗

The full causal ladder of spacetimes is constructed, and their updated main properties are developed. Old concepts and alternative definitions of each level of the ladder are revisited, with emphasis in minimum hypotheses. The implications of the recently solved ``folk questions on smoothability'', and alternative prop…

2006-09-26abs ↗pdf ↗

We give an explicit formula for the limiting gap distribution of slopes of saddle connections on the golden L, or any translation surface in its SL(2, R)-orbit, in particular the double pentagon. This is the first explicit computation of the distribution of gaps for a flat surface that is not a torus cover.

2013-08-20abs ↗pdf ↗

We propose a recurrent extension of the Ladder networks whose structure is motivated by the inference required in hierarchical latent variable models. We demonstrate that the recurrent Ladder is able to handle a wide variety of complex learning tasks that benefit from iterative inference and temporal modeling. The arch…

2017-07-28abs ↗pdf ↗

Improved variational inequality algorithms using adaptive step sizes.

problem Solving monotone variational inequalities and convex-concave min-max problems efficiently.
method Adaptive step sizes that eliminate hyperparameters and global Lipschitz continuity requirements.
result Eliminated the need for the golden ratio in the algorithm and improved complexity bounds.

Variational Autoencoders are powerful models for unsupervised learning. However deep models with several layers of dependent stochastic variables are difficult to train which limits the improvements obtained using these highly expressive models. We propose a new inference model, the Ladder Variational Autoencoder, that…

2016-02-06abs ↗pdf ↗

A novel SVR parameter optimization method using GSA outperforms other meta-heuristics in stock market forecasting.

problem Optimizing SVR parameters for reliable regression performance on small sample sizes.
method Golden Sine Algorithm (GSA) for parameter tuning of SVR.
result The GSA-based SVR outperforms eleven other meta-heuristics in terms of accuracy and computing time.

We combine supervised learning with unsupervised learning in deep neural networks. The proposed model is trained to simultaneously minimize the sum of supervised and unsupervised cost functions by backpropagation, avoiding the need for layer-wise pre-training. Our work builds on the Ladder network proposed by Valpola (…

2015-07-09abs ↗pdf ↗

We prove that the HOMFLYPT polynomial of a link, colored by partitions with a fixed number of rows is a qq-holonomic function. Specializing to the case of knots colored by a partition with a single row, it proves the existence of an (a,q)(a,q) super-polynomial of knots in 3-space, as was conjectured by string theorists. …

2016-04-28abs ↗pdf ↗

Over the past half-century, the empirical finance community has produced vast literature on the advantages of the equally weighted S\&P 500 portfolio as well as the often overlooked disadvantages of the market capitalization weighted Standard and Poor's (S\&P 500) portfolio (see \cite{Bloom}, \cite{Uppal}, \cite{Jacobs…

2016-03-19abs ↗pdf ↗

The leaderboard in machine learning competitions is a tool to show the performance of various participants and to compare them. However, the leaderboard quickly becomes no longer accurate, due to hack or overfitting. This article gives two pieces of advice to prevent easy hack or overfitting. By following these advice,…

2015-10-12abs ↗pdf ↗

The use of unsupervised data in addition to supervised data in training discriminative neural networks has improved the performance of this clas- sification scheme. However, the best results were achieved with a training process that is divided in two parts: first an unsupervised pre-training step is done for initializ…

2016-11-07abs ↗pdf ↗

The study of pseudo-Anosov maps with minimum expansion factor using train tracks.

problem Finding pseudo-Anosov maps with minimum expansion factor.
method Analysis of standardly embedded train tracks and Thurston symplectic form.
result The expansion factor of pseudo-Anosov maps is bounded by a specific inequality involving the golden ratio.

We establish a quadratic identity for the Yamada polynomial of ribbon cubic graphs in 3-space, extending the Tutte golden identity for planar cubic graphs. An application is given to the structure of the flow polynomial of cubic graphs at zero. The golden identity for the flow polynomial is conjectured to characterize …

2018-01-01abs ↗pdf ↗