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

295886115 · Jun 202019922001200920172026
48 results for lateral views

Reprint of a 1989 paper including minor corrections of misprints. Added comments (11 pages) about later related papers in the literature concerning comparison of Gabriel-Zisman calculus of (right) fractions and the use of generalized morphims in the sense of Haefliger-Skandalis-Hilsum for inverting differentiable equiv…

2008-03-28abs ↗pdf ↗

Unified view on random walk and Weisfeiler-Leman kernels, improving accuracy.

problem Improving graph kernel methods for better classification accuracy.
method Define and analyze walk-based node refinement methods, relate to Weisfeiler-Leman test, and introduce new walk-based kernels.
result Walk-based kernels are as expressive as Weisfeiler-Leman subtree kernel but support non-strict neighborhood comparison.

The goal of this study is to explain and examine the statistical underpinnings of the Bollinger Band methodology. We start off by elucidating the rolling regression time series model and deriving its explicit relationship to Bollinger Bands. Next we illustrate the use of Bollinger Bands in pairs trading and prove the e…

2012-12-20abs ↗pdf ↗

The article explores how organisms and machines learn and recognize the world using Bayesian inference and thermodynamics.

problem Understanding how organisms and machines learn and recognize the world.
method Introducing a thermodynamic view of the Bayesian brain hypothesis, using a simple generative model of spiking neural populations.
result The process of Bayesian inference can be quantified using entropy, revealing the perceptual capacity of neural activity.

The current leading computer vision models are typically feed forward neural models, in which the output of one computational block is passed to the next one sequentially. This is in sharp contrast to the organization of the primate visual cortex, in which feedback and lateral connections are abundant. In this work, we…

2019-10-16abs ↗pdf ↗

Convolutional neural network localizes OD and fovea in UWFoV-SLO images.

problem Localizing optic disc and fovea centers in ultra-widefield retinal images.
method Convolutional neural network trained on reflectance and autofluorescence images.
result 99.4% OD localisation accuracy and 99.1% fovea localisation accuracy.

Convolutional neural networks are commonly used to control the steering angle for autonomous cars. Most of the time, multiple long range cameras are used to generate lateral failure cases. In this paper we present a novel model to generate this data and label augmentation using only one short range fisheye camera. We p…

2018-08-20abs ↗pdf ↗

Human stablecoin transactions predict political risk in cryptocurrency markets.

problem Predicting political risk in cryptocurrency markets.
method Structural break analysis and surrogate-based robustness tests.
result Human-driven stablecoin transactions shift significantly before major political events.

Decision support tools that rely on supervised learning require large amounts of expert annotations. Using past radiological reports obtained from hospital archiving systems has many advantages as training data above manual single-class labels: they are expert annotations available in large quantities, covering a popul…

2019-10-07abs ↗pdf ↗

In this work we consider the Taylor expansion of the exponential map of a submanifold immersed in R^n up to order three, in order to introduce the concepts of lateral and frontal deviation. We compute the directions of extreme lateral and frontal deviation for surfaces in R^3. Also we compute, by using the Taylor expan…

2012-10-22abs ↗pdf ↗

Study on diagonal and separating coordinates for symmetric spaces of rank 1.

problem Existence and nonexistence of diagonal and separating coordinates for symmetric spaces of rank 1.
method Generalization of results by Gauduchon and Moroianu, 2020, and analysis of constant sectional curvature and orthogonal separation of variables.
result Diagonal coordinates exist if and only if the symmetric space has constant sectional curvature.

We study the Stochastic Gradient Descent (SGD) method in nonconvex optimization problems from the point of view of approximating diffusion processes. We prove rigorously that the diffusion process can approximate the SGD algorithm weakly using the weak form of master equation for probability evolution. In the small ste…

2017-05-22abs ↗pdf ↗

HawkesLLM models text generation with temporal influence, improving semantic alignment under limited memory.

problem Path-dependent uncertainty in agentic text-simulation systems.
method HawkesLLM framework separates temporal influence modeling from text generation, using a multivariate Hawkes process and a language model.
result HawkesLLM improves late-stage semantic alignment under a compact prompt-memory budget.

Modified BP attribution methods often ignore later layers' information, leading to misleading explanations.

problem Misleading explanations from modified BP methods ignoring later layers' information.
method Analysis of 9 modified BP methods including Deep Taylor Decomposition, LRP, Excitation BP, PatternAttribution, DeepLIFT, Deconv, RectGrad, Guided BP.
result Only DeepLIFT does not ignore later layers' information, providing a faithful explanation.

The paper studies boundedness of pseudo-differential operators on smooth manifolds.

problem Boundedness of pseudo-differential operators in LpL^p-LqL^q spaces on smooth manifolds.
method Using global symbols and extending Hörmander's condition, the paper investigates LpL^p-boundedness, LL^\infty-BMOBMO estimates, and LpL^p-LqL^q boundedness for Fourier multipliers and pseudo-differential operators.
result The paper proves LpL^p-LqL^q boundedness for the range 1<p2q<1<p \leq 2 \leq q<\infty.

Scarcity of labeled data is one of the most frequent problems faced in machine learning. This is particularly true in relation extraction in text mining, where large corpora of texts exists in many application domains, while labeling of text data requires an expert to invest much time to read the documents. Overall, st…

2018-07-12abs ↗pdf ↗

Observational learning is a type of learning that occurs as a function of observing, retaining and possibly replicating or imitating the behaviour of another agent. It is a core mechanism appearing in various instances of social learning and has been found to be employed in several intelligent species, including humans…

2017-06-20abs ↗pdf ↗

To better understand and improve the behavior of neural networks, a recent line of works bridged the connection between ordinary differential equations (ODEs) and deep neural networks (DNNs). The connections are made in two folds: (1) View DNN as ODE discretization; (2) View the training of DNN as solving an optimal co…

2019-11-01abs ↗pdf ↗

Unified study of stateful replay for streaming learning, reducing forgetting by 2-3x.

problem Catastrophic forgetting in streaming generative and predictive learning.
method Unified analysis of stateful replay for autoencoding, forecasting, and classification tasks.
result Stateful replay reduces average forgetting by a factor of 2-3 on heterogeneous multi-task streams.

This paper goes some way in explaining how to construct an integrable hierarchy of flows on the space of conformally immersed tori in n-space. These flows have first occured in mathematical physics -- the Novikov-Veselov and Davey-Stewartson hierarchies -- as kernel dimension preserving deformations of the Dirac operat…

2001-11-14abs ↗pdf ↗

We present the Video Ladder Network (VLN) for efficiently generating future video frames. VLN is a neural encoder-decoder model augmented at all layers by both recurrent and feedforward lateral connections. At each layer, these connections form a lateral recurrent residual block, where the feedforward connection repres…

2016-12-06abs ↗pdf ↗

The Ricci flow is an evolution system on metrics. For a given metric as initial data, its local existence and uniqueness on compact manifolds was first established by Hamilton \cite{Ha1}. Later on, De Turck \cite{De} gave a simplified proof. In the later of 80's, Shi \cite{Sh1} generalized the local existence result to…

2005-05-21abs ↗pdf ↗

The article studies factorization structures in geometry and their applications to cones and polytopes.

problem Understanding and characterizing factorization structures in geometry.
method Comprehensive study of factorization structures, including structure theory, construction of compatible polytopes and cones, and derivation of generalised Gale's evenness condition.
result Established generalised Vandermonde identities and found examples of Delzant and rational Delzant compatible polytopes.

We give a shorter proof of the existence of nontrivial closed minimal hypersurfaces in closed smooth (n+1)(n+1)--dimensional Riemannian manifolds, a theorem proved first by Pitts for 2n52\leq n\leq 5 and extended later by Schoen and Simon to any nn.

2009-05-26abs ↗pdf ↗

This article was originally published in Topology 22 (1983). The present hyperTeXed redaction includes references to post-1983 results as Addenda, and corrects a few typographical errors. (See math.GT/0411115 for a more comprehensive overview of the subject as it appears 21 years later.)

2004-11-14abs ↗pdf ↗

Neural networks can overfit perfectly to noisy data and then grok near-optimal generalization.

problem Neural networks' ability to overfit perfectly to noisy data and then generalize near-optimally.
method Two-layer ReLU networks trained by gradient descent on XOR cluster data.
result Neural networks can achieve perfect fit to noisy training data and then grok near-optimal generalization.