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,341 papers · 148 categories

Trend · papers per month

79158236315 · Jun 202019922001200920182026
48 results for story points

Crowd-powered system flags misinformation for fact checking.

problem Reduce the spread of fake news and misinformation on social media.
method Flexible temporal point process representation and scalable online algorithm Curb for optimal fact checking selection.
result Our scalable algorithm Curb can effectively reduce the spread of fake news and misinformation.

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.

Develops dual story for risk apportionment, interpreting preferences between lottery pairs.

problem Understanding preferences between different lottery pairs.
method Specifying model-free preferences towards nested classes of lottery pairs, developing dual story.
result Intuitive interpretation and full characterization of dual counterparts of prudence and temperance.

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.

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 ↗

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.

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.

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.

Determinantal point processes (DPPs) are elegant probabilistic models of repulsion that arise in quantum physics and random matrix theory. In contrast to traditional structured models like Markov random fields, which become intractable and hard to approximate in the presence of negative correlations, DPPs offer efficie…

2012-07-25abs ↗pdf ↗

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.

New DNN architecture for indoor localization in multi-story buildings.

problem Scalable indoor localization in complex multi-story buildings.
method Stacked autoencoder and feed-forward classifier for multi-label classification.
result Near state-of-the-art performance with lower complexity and energy consumption.

This thesis investigates belief propagation's performance in graphical models with loops.

problem Belief propagation's performance and convergence guarantees in models with loops are uncertain.
method Investigates how model parameters affect belief propagation's performance, convergence, and approximation quality.
result Model parameters influence the number of fixed points, convergence properties, and approximation quality of belief propagation.

Study of knot polynomials for twist satellites, generalizing cabling.

problem Lifting decomposition rule to superpolynomials for positive and negative twistings.
method General decomposition of satellite's colored HOMFLY polynomial in terms of original knot's contributions.
result Knot polynomials for twist satellites are related to Vogel's universality.

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 ↗

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 ↗

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 ↗

This paper constructs real algebraic maps that are topologically special generic maps.

problem Constructing smooth maps in differential topology and real algebraic geometry.
method Constructs real algebraic maps that are topologically special generic maps.
result Real algebraic maps are topologically special generic maps.

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.

The study investigates the consistency of kk-means clustering under finite expectation assumptions.

problem Consistency of kk-means clustering under finite expectation assumptions.
method Investigates the conditions under which kk-means clustering is consistent, considering finite expectation instead of finite variance.
result Inconsistency can arise due to extreme cluster imbalance, leading to some clusters having few points.

Study of knotted defects in smectic liquid crystals using topological knot theory.

problem Understanding the topological structure of knotted defects in smectic liquid crystals.
method Investigation of screw and edge dislocations, focusing on their radial surface structure and knot fibration.
result Established a connection between smectic defects and knot theory, revealing the topological knotting of defects.

In this note we show that for any hyperbolic surface S, the number of geodesics of length bounded above by L in the mapping class group orbit of a fixed closed geodesic with a single double point is asymptotic to L raised to the dimension of the Teichmuller space of S. Since closed geodesics with one double point fall …

2009-01-16abs ↗pdf ↗

The study finds PK cone metrics on complex manifolds near hyperplane arrangements.

problem Finding metrics on complex manifolds near singularities.
method Analyzing flat torsion-free meromorphic connections on \(\mathbb{C}^n\) with simple poles at hyperplanes.
result Metric completion of certain connections yields PK cone metrics on \(\mathbb{C}^n\).

A machine learning surrogate model predicts earthquake-induced building responses.

problem Expensive FE model simulations for earthquake damage estimation.
method SVD-based earthquake characterization and machine learning model training.
result Deep neural network provides most accurate predictions of building responses.

Article explores Thurston's circle packing theorem in 3-manifold geometry.

problem Understanding Thurston's circle packing theorem in 3-manifold geometry.
method Analyzes the Koebe-Andre'ev-Thurston Theorem and its relation to Thurston's circle packing theorem.
result Illustrates the significance of Thurston's circle packing theorem in 3-manifold geometry.

Visualizes board connections for socially responsible investing insights.

problem Understanding corporate governance and sustainability through board connections.
method Data Visualization tool to reveal connections between Directors and Executives.
result Strength of tool in investigating corporate governance and sustainability.