arXiv research

Stock market prediction is still a challenging problem because there are many factors effect to the stock market price such as company news and performance, industry performance, investor sentiment, social media sentiment and economic factors. This work explores the predictability in the stock market using Deep Convolu…

Martingale Doppelgänger-Eval benchmarks VLMs on candlestick evidence vs. trend extrapolation

Trading strategies improved by classifying financial time-series images.

Framework explains deep learning candlestick recognition.

Paper improves candlestick classification model's resistance to adversarial attacks.

Paper develops new spot regression estimators using candlesticks for asset pricing.

FinVision uses LLM agents to predict stock markets by processing various financial data types.

MountainLion uses LLMs to interpret financial data and generate investment strategies.

Proposes a method to generate high-quality candlestick data for financial trading.

Study integrates deep learning with financial data for improved trading strategies.

We propose a novel investment decision strategy (IDS) based on deep learning. The performance of many IDSs is affected by stock similarity. Most existing stock similarity measurements have the problems: (a) The linear nature of many measurements cannot capture nonlinear stock dynamics; (b) The estimation of many simila…

Dynamics of the major USA market indices DJIA, S&P, Nasdaq, and NYSE is analyzed from the point of view of the random walking problem with two-step correlations of the market moves. The parameters characterizing the stochastic dynamics are determined empirically from the historical quotes for the daily, weekly, and mon…

No minimal charts with exactly seven white vertices found.

This paper studies minimal charts of a specific type to understand embedded surfaces in 4-space.

In this paper, we give definitions of three kinds of minimal charts, and we investigate properties of minimal charts and establish fundamental theorems characterizing minimal charts. To classify charts with two or three crossings we use the fundamental theorems. In the future paper, we give an numeration of the charts …

No minimal chart of type (7) exists.

No minimal chart of type (4,3) exists in 4-space.

Paper classifies surface-links using charts with specific properties.

The paper studies 4-charts with three crossings and their equivalence to a specific knot.

No minimal chart of type (2,3,2) exists.

Minimal charts of specific type contain unique subgraphs.

The study uses stock market indicators to forecast COVID-19 cases.

In this paper, we shall show a condition for that a chart is C-move equivalent to the product of two charts, the union of two charts $Γ^*$ and $Γ^{**}$ which are contained in disks $D^*$ and $D^{**}$ with $D^*\cap D^{**}=\emptyset$.

Study tests five popular trading signal families and finds four refuted, one inconclusive, and one not refuted.

Support Vector Data Description (SVDD) is a machine learning technique used for single class classification and outlier detection. SVDD based K-chart was first introduced by Sun and Tsung for monitoring multivariate processes when underlying distribution of process parameters or quality characteristics depart from Norm…

A method to fix radius distortion in generative models on curved spaces.

Paper improves channel charting using autoencoders with spatial constraints.

A branched covering surface-knot is a surface-knot in the form of a branched covering over an oriented surface-knot $F$, where we include the case when the covering has no branch points. A branched covering surface-knot is presented by a graph called a chart on a surface diagram of $F$. We can simplify a branched cover…

Let $Γ$ be a chart. For each label $m$, we denote by $Γ_m$ the "subgraph" of $Γ$ consisting of all the edges of label $m$ and their vertices. Let $Γ$ be a minimal chart of type $(m;3,3)$. That is, a minimal chart $Γ$ has six white vertices, and both of $Γ_m\capΓ_{m+1}$ and $Γ_{m+1}\capΓ_{m+2}$ consist of three white ve…

A 2-dimensional braid over an oriented surface-knot $F$ is presented by a graph called a chart on a surface diagram of $F$. We consider 2-dimensional braids obtained by an addition of 1-handles equipped with chart loops. We introduce moves of 1-handles with chart loops, called 1-handle moves, and we investigate how muc…

A branched covering surface-knot over an oriented surface-knot $F$ is a surface-knot in the form of a branched covering over $F$. A branched covering surface-knot over $F$ is presented by a graph called a chart on a surface diagram of $F$. For a branched covering surface-knot, an addition of 1-handles equipped with cha…

Let $Γ$ be a chart, and we denote by $Γ_m$ the union of all the edges of label $m$. A chart $Γ$ is of type $(3,2,2)$ if there exists a label $m$ such that $w(Γ)=7$, $w(Γ_m\capΓ_{m+1})=3$, $w(Γ_{m+1}\capΓ_{m+2})=2$, and $w(Γ_{m+2}\capΓ_{m+3})=2$ where $w(G)$ is the number of white vertices in $G$. In this paper, we prov…

Dance Dance Revolution (DDR) is a popular rhythm-based video game. Players perform steps on a dance platform in synchronization with music as directed by on-screen step charts. While many step charts are available in standardized packs, players may grow tired of existing charts, or wish to dance to a song for which no …

New surfaces in 4-ball constructed from knits, described by charts.

MM-DREX adapts LLM experts for financial trading via dynamic routing.

Chart autoencoders learn latent features preserving manifold topology and geometry, with robust denoising capabilities.

Chart descriptions are a graphic method to describe monodromy representations of various topological objects. Here we introduce a chart description for hyperelliptic Lefschetz fibrations, and show that any hyperelliptic Lefschetz fibration can be stabilized by fiber-sum with certain basic Lefschetz fibrations.

We investigate minimal charts with loops, a simple closed curve consisting of edges of label $m$ containing exactly one white vertex. We shall show that there does not exist any loop in a minimal chart with exactly seven white vertices in this paper.

Introduces Hurewicz fibrations for embedding maps of orbifold charts.

Chart descriptions are a graphic method to describe monodromy representations of various topological objects. Here we introduce a chart description for genus-two Lefschetz fibrations, and show that any genus-two Lefschetz fibration can be stabilized by fiber-sum with certain basic Lefschetz fibrations.

Stock prediction has always been attractive area for researchers and investors since the financial gains can be substantial. However, stock prediction can be a challenging task since stocks are influenced by a multitude of factors whose influence vary rapidly through time. This paper proposes a novel approach (Word2Vec…

We give a combinatorial description of closed curves on oriented surfaces in terms of certain permutations, called charts. We describe automorphisms of curves in terms of charts and compute the total number of curves counted with appropriate weights. We also discuss relations between curves, Grothendieck dessins d'enfa…

We propose channel charting (CC), a novel framework in which a multi-antenna network element learns a chart of the radio geometry in its surrounding area. The channel chart captures the local spatial geometry of the area so that points that are close in space will also be close in the channel chart and vice versa. CC w…

Given a 2-crossing minimal chart $Γ$, a minimal chart with two crossings, set $α=\min\{~i~|~$there exists an edge of label $i$ containing a white vertex$\}$, and $β=\max\{~i~|~$there exists an edge of label $i$ containing a white vertex$\}$. In this paper we study the structure of a neighbourhood of $Γ_α\cupΓ_β$, and p…

Unified Siamese network for wireless positioning and channel charting.

The paper proves uniform Temple charts and applies them to null distance metrics.

Introduces orbifolds from charts and various topological perspectives.

This is the first step of the two steps to enumerate the minimal charts with two crossings. For a label $m$ of a chart $Γ$ we denote by $Γ_m$ the union of all the edges of label $m$ and their vertices. For a minimal chart $Γ$ with exactly two crossings, we can show that the two crossings are contained in $Γ_α\capΓ_β$ f…