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.

169,051 papers · 148 categories

Trend · papers per month

11223344 · May 202619922001200920182026
48 results for story tracking

Contagions such as the spread of popular news stories, or infectious diseases, propagate in cascades over dynamic networks with unobservable topologies. However, "social signals" such as product purchase time, or blog entry timestamps are measurable, and implicitly depend on the underlying topology, making it possible …

2016-06-28abs ↗pdf ↗

This work recommends personalized search stories to users based on their interests.

problem Personalized search story recommendation within search engines.
method Deep reinforcement learning architecture trained by imitation learning and reinforcement learning.
result Empirically demonstrated effectiveness on real-world data sets.

Modeling true and false news diffusion in social networks using homogeneity.

problem Difficulties in distinguishing true from false news in social networks.
method Proposes a Bayesian nonparametric model that incorporates homogeneity of news stories to predict their genuineness.
result Homogeneity values of news stories strongly correlate with their genuineness and content.

Although there has been substantial research in software analytics for effort estimation in traditional software projects, little work has been done for estimation in agile projects, especially estimating user stories or issues. Story points are the most common unit of measure used for estimating the effort involved in…

2016-09-02abs ↗pdf ↗

The paper tackles entity induction and reference in visual storytelling.

problem Coherence in visual storytelling through proper entity introduction and reference.
method Building an entity skeleton, using an encoder-decoder framework, and proposing a glocal hierarchical attention model.
result The proposed models outperform the baseline in automatic evaluation metrics and human preference.

Paper proposes a deep learning architecture for generating long stories from images.

problem Maintaining context in long event sequences for visual storytelling.
method Hierarchical deep learning architecture with encoder-decoder networks and natural language descriptions.
result Our method outperforms state-of-the-art techniques on automatic evaluation metrics.

By specifying model free preferences towards simple nested classes of lottery pairs, we develop the dual story to stand on equal footing with that of (primal) risk apportionment. The dual story provides an intuitive interpretation, and full characterization, of dual counterparts of such concepts as prudence and tempera…

2017-12-06abs ↗pdf ↗

Generates coherent storybooks from plain text using diffusion models.

problem Ensuring coherency in a sequence of images for storytelling applications.
method Combines pre-trained LLM and text-guided Latent Diffusion Model for zero-shot generation.
result Outperforms state-of-the-art image editing baselines in generating coherent storybooks.

Users can anticipate follower preferences by balancing feedback exploitation and exploration.

problem How users can anticipate their followers' preferences based on feedback.
method Theoretical analysis and practical algorithms for sequential decision making and utility maximization.
result Users need to balance exploitation and exploration to succeed in anticipating follower preferences.

Storytelling algorithms aim to 'connect the dots' between disparate documents by linking starting and ending documents through a series of intermediate documents. Existing storytelling algorithms are based on notions of coherence and connectivity, and thus the primary way by which users can steer the story construction…

2016-02-21abs ↗pdf ↗

We give a different perspective on the (by now) classic Basmajian identity, and point out some related results, both in the setting of hyperbolic manifolds, and in the polyhedral setting \emph{without} any group acting. In the new version we give more geometric and combinatorial applications of the main ideas.

2014-04-06abs ↗pdf ↗

This paper and its sequel prove a generalization of the usual gluing theorem for two index 1 pseudoholomorphic curves u_+ and u_- in the symplectization of a contact 3-manifold. We assume that for each embedded Reeb orbit gamma, the total multiplicity of the negative ends of u_+ at covers of gamma agrees with the total…

2007-01-10abs ↗pdf ↗

A 4-manifold is constructed with some curious metric properties; or maybe it is many 4-manifolds masquerading as one, which would explain why it looks curious. Anyway, knots in the 3-sphere with complete finite volume hyperbolic metrics on their complements play a role in this story.

2016-02-04abs ↗pdf ↗

This paper is an expansion of my lecture for David Epstein's birthday, which traced a logical progression from ideas of Euclid on subdividing polygons to some recent research on invariants of hyperbolic 3-manifolds. This `logical progression' makes a good story but distorts history a bit: the ultimate aims of the chara…

1997-12-04abs ↗pdf ↗

There are multiple sides to every story, and while statistical topic models have been highly successful at topically summarizing the stories in corpora of text documents, they do not explicitly address the issue of learning the different sides, the viewpoints, expressed in the documents. In this paper, we show how thes…

2016-08-14abs ↗pdf ↗

This work uses SVM to identify track component failures in AC Track Circuits.

problem Detecting and identifying specific track component failures in AC Track Circuits.
method Applied SVM classifier to STDS track circuit data.
result Successfully classified 15 different track component failures.

Tangle machines are a topologically inspired diagrammatic formalism to describe information flow in networks. This paper begins with an expository account of tangle machines motivated by the problem of describing `covariance intersection' fusion of Gaussian estimators in networks. It then gives two examples in which ta…

2015-11-16abs ↗pdf ↗

New method uses cluster shapes to improve track finding in particle collisions.

problem Combining timing and additional detector information for efficient track finding.
method Neural networks to analyze cluster shapes for track seeding.
result Cluster shapes reduce fake combinatorial backgrounds while maintaining high track efficiency.

Replication study shows Deep-SE still not as effective as previously thought for agile effort estimation.

problem Improving accuracy in estimating agile software development effort.
method Close replication of Deep-SE using additional data and comparison with multiple baselines.
result Deep-SE outperforms only a few cases, suggesting more work is needed.

Value-tracking in financial markets breaks down when non-valuation-based traders dominate.

problem Understanding the threshold for value-tracking in financial markets.
method Simple discrete-time model to show how non-valuation-based traders can cause tracking errors.
result A threshold above which value-tracking breaks down without changes in asset value.

New algorithms tackle multi-agent problems with hybrid action spaces.

problem Applying deep reinforcement learning to multi-agent problems with discrete-continuous hybrid action spaces.
method Proposed two novel algorithms: Deep MAPQN and Deep MAHHQN, using centralized training and decentralized execution.
result Empirical results show both algorithms significantly outperform existing methods.

This paper optimizes object tracking on edge devices with small matrices.

problem Efficiently tracking objects in video sequences on edge devices with small matrices.
method Parallelized a Simple Online and Real-time Tracking (SORT) application on shared-memory multicores.
result Throughput-based parallelization technique outperforms multi-threading for small matrices.

A DRL-based strategy improves vehicle tracking accuracy while saving energy.

problem Enhancing vehicle tracking accuracy in WSNs without increasing energy consumption.
method Decentralized strategy with dynamic reinforcement learning to adjust sensing areas.
result Simulation results demonstrate superior performance of DRL-aided design.

Paper introduces TAP-Vid, a benchmark for tracking any point in videos.

problem Tackles the problem of tracking arbitrary physical points on surfaces over longer video clips.
method Formalizes the problem as TAP, introduces TAP-Vid benchmark, uses crowdsourced pipeline with optical flow estimates, proposes TAP-Net model.
result TAP-Net outperforms all prior methods on TAP-Vid benchmark when trained on synthetic data.

We show that the subsurface projection of a train track splitting sequence is an unparameterized quasi-geodesic in the curve complex of the subsurface. For the proof we introduce induced tracks, efficient position, and wide curves. This result is an important step in the proof that the disk complex is Gromov hyperbolic…

2010-04-26abs ↗pdf ↗

A novel tracking method for dense honeybee colonies using pixel personality.

problem Tracking large numbers of densely-arranged, interacting objects in a 2D environment.
method Segmentation-based object detection followed by adaptive object recognition through visual appearance.
result Reconstructed ~46% of trajectories in 5 minutes and 71% of tracks for at least 2 minutes.

Dynamic tracking error framework shows similar performance but varying volatility across different constraints.

problem Differences in governance parameters between Total Portfolio Approach and Strategic Asset Allocation.
method Portfolio simulations using U.S. equity and bond data from 2000 to 2026, spanning 2004 to 2026.
result Realized tracking error volatility varies 12-fold across different constraints, with costs highest during crises.

Bayesian approach for constructing and rebalancing sparse index-tracking portfolios.

problem Sparse tracking of a reference index with uncertainty quantification.
method Sparse linear regression with Laplace prior, empirical-Bayes calibration, Langevin-type MCMC, threshold-based rules.
result Posterior uncertainty on tracking error, portfolio composition, and rebalancing moves.

Automated method selects eye tracking variables for categorization tasks.

problem Limited duration of infant cooperation and biases in handpicked eye tracking variables.
method Automated selection of eye tracking variables using statistical techniques.
result Same eye tracking variables classify category learners from non-learners in adults and infants with high accuracy.