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

481115 · Oct 202419922001200920172026
48 results for Marked TPPs

New model captures time and mark inter-dependence in TPPs.

problem Limited predictive performance of conditionally independent TPP models on entangled time and mark interactions.
method Developed a multivariate TPP that models conditional inter-dependence of time and mark, using both intensity-based and intensity-free models.
result Proposed TPP models outperform conditionally independent and dependent models in standard prediction tasks.

Paper establishes bounds for RNN-TPPs, showing four-layer networks can achieve vanishing errors.

problem Understanding theoretical limits of RNN-TPPs.
method Characterized RNN complexity, constructed neural approximations, applied truncation technique.
result Four-layer RNN-TPPs can achieve vanishing generalization errors.

Smooth neural TPPs using B-splines for better efficiency and accuracy.

problem Efficiently modeling sequences of events in continuous time with neural networks.
method Directly parametrize the CIF as a non-negative combination of B-spline basis functions, predicting coefficients with a neural network.
result Improved computational efficiency and predictive accuracy compared to existing methods.

HRTPP improves TPP interpretability and accuracy in medical event modeling.

problem Lack of interpretability in TPPs for medical event sequences.
method Hybrid-Rule Temporal Point Processes (HRTPP) integrating temporal logic rules and numerical features.
result HRTPP outperforms state-of-the-art interpretable TPPs in predictive performance and clinical interpretability.

Generative model for TPPs using signatures and distributional discrepancies.

problem Limitations of signature methods for TPPs and lack of global sequence-level loss in neural models.
method Introduce interarrival embedding to lift jump paths to continuous paths of bounded variation, enabling signature methods for discrete event sequences. Develop sigTPP, a signature-based generative model trained on path-level loss.
result sigTPP achieves the best average rank across multiple metrics and outperforms or is within a standard error of the strongest baseline in 64% of dataset-metric pairs.

The paper characterizes SLOPE's trade-off between FDP and TPP, showing its power limit and superiority over Lasso.

problem Characterizing the SLOPE trade-off between FDP and TPP.
method Using variational perspective and Gaussian random designs, the paper derives upper and lower bounds on the optimal trade-off.
result SLOPE outperforms Lasso in terms of FDP, TPP, and l2 estimation risk.

Efficiently models event-based data with general parametric kernels.

problem Inference for Hawkes processes with general parametric kernels requires large datasets.
method Developed a fast 2\ell_2 gradient-based solver using a discretized version of events.
result Improved estimation of pattern latency in brain signals.

TriTPP models enable faster and more flexible event data modeling.

problem Inflexibility and slow sampling in traditional TPP models.
method Triangular Maps and Normalizing Flows for parallel sampling and likelihood computation.
result TriTPP models achieve orders of magnitude faster sampling while maintaining flexibility.

Latent Block-Diffusion Temporal Point Processes (LBDTPP) is a semi-autoregressive framework for generating asynchronous event sequences.

problem Generating asynchronous event sequences
method Latent Block-Diffusion Temporal Point Processes
result Outperforms state-of-the-art TPP baselines in both unconditional and conditional generation tasks

Event sequences can be modeled by temporal point processes (TPPs) to capture their asynchronous and probabilistic nature. We propose an intensity-free framework that directly models the point process distribution by utilizing normalizing flows. This approach is capable of capturing highly complex temporal distributions…

2019-10-18abs ↗pdf ↗

We present a marked analogue of Carter and Saito's movie theorem. Our definition of marking was chosen to coincide with the markings that arise in link Floer homology. In order to deal with complications arising from certain isotopies, we define three equivalence relations for marked surfaces and work over an equivalen…

2014-07-17abs ↗pdf ↗

We are now witnessing the increasing availability of event stream data, i.e., a sequence of events with each event typically being denoted by the time it occurs and its mark information (e.g., event type). A fundamental problem is to model and predict such kind of marked temporal dynamics, i.e., when the next event wil…

2017-01-14abs ↗pdf ↗

Methodology for estimating marked Hawkes processes with neural networks.

problem Estimating conditional intensity of marked Hawkes processes.
method Proposes two models: Shallow Neural Hawkes with marks and Neural Network for Non-Linear Hawkes with Marks.
result Validation on synthetic datasets and real-world cryptocurrency order book data.

Study approximate marked length spectrum rigidity in non-positively curved groups.

problem Approximate rigidity of marked length spectra in non-positively curved groups.
method Compare marked length spectra of isometric actions of groups with non-positively curved features.
result Supremum of quotient of marked length spectra is approximately determined by restricted spectra.

Motivated by the prediction of cell loads in cellular networks, we formulate the following new, fundamental problem of statistical learning of geometric marks of point processes: An unknown marking function, depending on the geometry of point patterns, produces characteristics (marks) of the points. One aims at learnin…

2018-12-19abs ↗pdf ↗

We use Fox calculus to assign a marked polytope to a `nice' group presentation with two generators and one relator. Relating the marked vertices to Novikov-Sikorav homology we show that they determine the Bieri-Neumann-Strebel invariant of the group. Furthermore we show that in many cases the marked polytope is an inva…

2015-01-14abs ↗pdf ↗

Quantum duality map extended to general marked surfaces and its compatibility with skein algebras proven.

problem Generalizing quantum duality map to general marked surfaces and proving its compatibility with skein algebras.
method Generalized quantum duality map, reduced stated skein algebras, quantum trace maps, skein lifting.
result Compatibility of quantum duality map with skein algebras proven.

In this paper, we construct the moduli space of marked oper structures on a closed, oriented smooth surface of negative Euler characteristic as a holomorphic fiber bundle over Teichmüller space. We prove that the holonomy map from the space of marked oper structures to the moduli space of reductive flat bundles is a ho…

2018-04-12abs ↗pdf ↗

In all dimensions, we prove that the marked length spectrum of a Riemannian manifold (M,g)(M,g) with Anosov geodesic flow and non-positive curvature locally determines the metric in the sense that two close enough metrics with the same marked length spectrum are isometric. In addition, we provide a completely new stabilit…

2018-06-11abs ↗pdf ↗

Survey of stated skein modules/algebras of 3-manifolds/surfaces.

problem Understanding stated skein modules/algebras of 3-manifolds/surfaces.
method Discussion of splitting homomorphism, general structures, Frobenius homomorphism, center, dimension, representation theory.
result Skein algebra of non-closed marked surface at any root of 1 is a maximal order.

We show that all GL(2,R) equivariant point markings over orbit closures of translation surfaces arise from branched covering constructions and periodic points, completely classify such point markings over strata of quadratic differentials, and give applications to the finite blocking problem.

2017-08-10abs ↗pdf ↗

It is well known that surface-links in 4-space can be presented by diagrams on the plane of 4-valent spatial graphs with makers on the vertices, called marked graph diagrams. In this paper we extend the method of presenting surface-links by marked graph diagrams to presenting immersed surface-links. We also give some m…

2017-07-15abs ↗pdf ↗

Develops quasi-likelihood analysis for marked point processes and applies it to Hawkes processes.

problem Analyzing multivariate marked point processes and their applications.
method Quasi-likelihood analysis for a general class of multivariate marked point processes, with focus on marked Hawkes processes.
result The quasi-likelihood analysis for marked Hawkes processes provides explicit conditions for ergodicity and Markovian transformation.

The paper extends intensity models for limit order books using marked point processes.

problem Modeling intensity ratios in limit order books with state dependency and clustering.
method Developed a new model combining three multiplicative components for marked point processes.
result The new model outperforms other intensity-based methods in predicting market order signs and aggressiveness.

We prove that the classical set of moves for standard spines of 3-manifolds (i.e. the MP-move and the V-move) does not suffice to relate to each other any two standard skeleta of a 3-manifold with marked boundary. We also describe a condition on the 3-manifold with marked boundary that tells whether the generalised set…

2008-04-04abs ↗pdf ↗

New theorem shows metrics of certain groups are close if their lengths are identical.

problem Identifying metrics of relatively hyperbolic groups from their lengths.
method Proved rigidity for relatively hyperbolic groups using coarse marked length spectrum.
result Metrics of relatively hyperbolic groups are uniformly close if lengths are identical.

Marked vertex diagrams provide a combinatorial way to represent knotted surfaces in R4\mathbb{R}^4; including virtual crossings allows for a theory of virtual knotted surfaces and virtual cobordisms. Biquandle counting invariants are defined only for marked vertex diagrams representing knotted orientable surfaces; we e…

2014-09-27abs ↗pdf ↗

In earlier work the Kauffman bracket polynomial was extended to an invariant of marked graphs, i.e., looped graphs whose vertices have been partitioned into two classes (marked and not marked). The marked-graph bracket polynomial is readily modified to handle graphs with weighted vertices. We present formulas that simp…

2009-05-29abs ↗pdf ↗