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

176351527702 · Jun 202019922001200920172026
48 results for time embedding

Study symplectic embeddings of 4-manifolds using Lefschetz fibrations.

problem Proper symplectic and iso-symplectic embeddings of 4-manifolds in 6-manifolds.
method Use Lefschetz fibrations to study symplectic embeddings.
result Closed orientable smooth 4-manifolds admitting Lefschetz fibrations over CP^1 can be embedded symplectically in (CP^1 × CP^1 × CP^1, ω_pr).

Study embedding of achiral Lefschetz fibrations in 6D manifolds.

problem Embedding achiral Lefschetz fibrations in 6D manifolds.
method Analyzing Lefschetz fibrations bounding open books and embedding them in 6D manifolds.
result Every achiral Lefschetz fibration with hyperelliptic monodromy admits LF embedding in D6=D2imesD4D^6 = D^2 imes D^4.

Meta-learning for Koopman spectral analysis with short time-series data.

problem Lack of long time-series for training embedding functions in Koopman spectral analysis.
method Meta-learning approach using bidirectional LSTM and neural network to estimate embedding functions from short time-series.
result The proposed method achieves better performance in eigenvalue estimation and future prediction compared to existing methods.

We present a probabilistic language model for time-stamped text data which tracks the semantic evolution of individual words over time. The model represents words and contexts by latent trajectories in an embedding space. At each moment in time, the embedding vectors are inferred from a probabilistic version of word2ve…

2017-02-27abs ↗pdf ↗

Existence of balanced embedding proved for complex manifold into infinite-dimensional space.

problem Balanced embedding of non-compact complex manifolds into infinite-dimensional projective space.
method Gradient flow in a Hilbert space, long-time existence established by perturbation, convergence depends on a priori bounds.
result Existence of balanced embedding proved in a model case.

AUASE embeds dynamic networks with stability guarantees for node comparison.

problem Stability in dynamic network embeddings for comparing nodes across time.
method Attributed unfolded adjacency spectral embedding (AUASE) for stable unsupervised learning.
result AUASE provides significant improvements in link prediction and node classification.

In this work we prove the fact that, for a short time, it is possible to construct a smooth parametrized family of isometric embeddings of an arbitrary smooth parametrized family of Riemannian metrics on a smooth closed manifold into an Euclidean space. In order to prove this statement we work out stability estimates w…

2017-12-07abs ↗pdf ↗

ULES embeds dynamic networks with stability guarantees.

problem Stability of time-varying node embeddings in evolving networks.
method Unfolded Laplacian Spectral Embedding (ULSE) using normalized Laplacian operators.
result ULES satisfies cross-sectional and longitudinal stability under dynamic stochastic block model.

Sparse OSEs achieve optimal embedding dimension of O(d).

problem Achieving optimal embedding dimension for sparse OSEs.
method Random sparsified matrix with m(1+θ)dm \geq (1+θ)d non-zeros per column.
result Sparse OSEs can achieve embedding dimension m=O(d)m=O(d), improving on previous m=O(dlog(d))m=O(d\log(d)).

Network representation learning in low dimensional vector space has attracted considerable attention in both academic and industrial domains. Most real-world networks are dynamic with addition/deletion of nodes and edges. The existing graph embedding methods are designed for static networks and they cannot capture evol…

2018-12-06abs ↗pdf ↗

An embedding of the m-times punctured disc into the n-times punctured disc, for n>m, yields an embedding of the braid group on m strands B_m into the braid group on n strands B_n, called a geometric embedding. The main example consists of adding n-m trivial strands to the right of each braid on m strands. We show that …

2013-08-06abs ↗pdf ↗

We work entirely in the smooth category. An embedding f:(S2×S1)S3R6f:(S^2\times S^1)\sqcup S^3\rightarrow {\mathbb R}^6 is {\it Brunnian}, if the restriction of ff to each component is isotopic to the standard embedding. For each triple of integers k,m,nk,m,n such that mn(mod2)m\equiv n \pmod{2}, we explicitly construct a Brunnian embedd…

2014-08-18abs ↗pdf ↗

Time-delayed embeddings avoid self-intersections for high enough delay.

problem Analyzing self-intersections in time-delayed embeddings.
method Study of time-delayed coordinate maps for diffeomorphisms on compact manifolds.
result For high enough delay, time-delayed embeddings avoid self-intersections almost everywhere.

In this note, we discuss embeddings of 33--manifolds via open books. First we show that every open book of every closed orientable 33--manifold admits an open book embedding in any open book decompistion of S2×S3S^2 \times S^3 and S2×~S3S^2 \widetilde{\times} S^3 with the page a disk bundle over S2S^2 and monodromy the iden…

2018-06-26abs ↗pdf ↗

We show that any metric on S2S^2 with Gauss curvature KκK \geq -κ admits a C1,1C^{1,1}-isometric embedding into the hyperbolic space with sectional curvature κ. We also give a sufficient condition for a metric on S2S^2 to be isometrically embedded into anti-de Sitter spacetime with the prescribed cosmological time fun…

2014-01-23abs ↗pdf ↗

We give an algorithm to decide which elements of pi_2(S^2\times S^1#...#S^2\times S^1) can be represented by embedded spheres. Such spheres correspond to splittings of the free group on k generators. Equivalently our algorithm decides whether, for a handlebody N, an element in pi_2(N,\partial N) can be represented by a…

2004-10-04abs ↗pdf ↗

Study geodesic properties of time series data using Wasserstein metric.

problem Modeling nonlinear time series with transport-based metrics.
method Generalized Wasserstein metric and signed cumulative distribution transforms.
result Geodesic properties provide added interpretability and robustness in time series classifiers.

OracleAD detects multivariate time series anomalies without labels.

problem Rare and unlabeled multivariate time series anomalies.
method OracleAD encodes past sequences into causal embeddings, projects them into a latent space, and identifies anomalies based on deviations from a stable latent structure.
result OracleAD achieves state-of-the-art results and is interpretable.

Study of metrics on spheres and their complex structure properties.

problem Identifying metrics on spheres and their complex structure properties.
method Identify metrics via Nash isometric embeddings, use isotopic extension theorem, and analyze extrinsic quantities.
result No sphere of dimensions 6 or higher can be diffeomorphic to a complex manifold.

Production recommendation systems rely on embedding methods to represent various features. An impeding challenge in practice is that the large embedding matrix incurs substantial memory footprint in serving as the number of features grows over time. We propose a similarity-aware embedding matrix compression method call…

2019-02-26abs ↗pdf ↗

In this paper, we provide some results on Skorokhod embedding with local time and its applications to the robust hedging problem in finance. First we investigate the robust hedging of options depending on the local time by using the recently introduced stochastic control approach, in order to identify the optimal hedgi…

2015-11-23abs ↗pdf ↗

Phase2vec learns embeddings of dynamical systems without supervision.

problem Predicting the classes of 2D dynamical systems from data.
method Physics-informed convolutional network that extracts geometric features and minimizes reconstruction loss.
result Learned embeddings respect the semantics of physical systems and outperform blackbox classifiers.

Graph embedding provides an efficient solution for graph analysis by converting the graph into a low-dimensional space which preserves the structure information. In contrast to the graph structure data, the i.i.d. node embedding can be processed efficiently in terms of both time and space. Current semi-supervised graph…

2017-05-15abs ↗pdf ↗

Topic modeling analyzes documents to learn meaningful patterns of words. For documents collected in sequence, dynamic topic models capture how these patterns vary over time. We develop the dynamic embedded topic model (D-ETM), a generative model of documents that combines dynamic latent Dirichlet allocation (D-LDA) and…

2019-07-12abs ↗pdf ↗

Study on fundamental groups of framed circle embeddings in 4-manifolds.

problem Understanding the fundamental groups of spaces of framed embeddings of a circle in 4-manifolds.
method Investigates the fundamental groups of spaces of embeddings of S1imesD3S^1 imes D^3 in 4-manifolds, focusing on framed immersed circles.
result Investigates the fundamental groups of spaces of framed embeddings of a circle in 4-manifolds, providing insights into the structure of these groups.

Networks evolve continuously over time with the addition, deletion, and changing of links and nodes. Such temporal networks (or edge streams) consist of a sequence of timestamped edges and are seemingly ubiquitous. Despite the importance of accurately modeling the temporal information, most embedding methods ignore it …

2019-04-12abs ↗pdf ↗

Word evolution refers to the changing meanings and associations of words throughout time, as a byproduct of human language evolution. By studying word evolution, we can infer social trends and language constructs over different periods of human history. However, traditional techniques such as word representation learni…

2017-03-02abs ↗pdf ↗

HyFAD improves time series imputation by combining time and frequency diffusion.

problem Improve time series imputation by handling frequency-sensitive denoising and balancing global and local dynamics.
method HyFAD is a hybrid time-frequency diffusion model with frequency-aware embedding, built on DDPM paradigm.
result HyFAD achieves state-of-the-art performance in time series imputation.

Authors construct hypertori with constant negative mean curvature in a sphere.

problem Constructing constant mean curvature hypertori in a sphere.
method Constructing two different constant mean curvature (2n1)(2n-1)-dimensional hypertori in a 2n2n-dimensional sphere.
result Two different constant mean curvature (2n1)(2n-1)-dimensional hypertori with negative mean curvature in a 2n2n-dimensional sphere.

Word embeddings are a powerful approach for unsupervised analysis of language. Recently, Rudolph et al. (2016) developed exponential family embeddings, which cast word embeddings in a probabilistic framework. Here, we develop dynamic embeddings, building on exponential family embeddings to capture how the meanings of w…

2017-03-23abs ↗pdf ↗