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

25.0%50.0%75.0%100.0% · Jul 199219922001200920182026
48 results for movies of fibrations

We present a grid diagram analogue of Carter, Rieger and Saito's smooth movie theorem. Specifically, we give definitions for grid movies, grid movie isotopies and present a definition of grid planar isotopy as a particular subset of the grid diagram moves: stabilization, destabilization and commutation. We show that gr…

2013-03-07abs ↗pdf ↗

Paper classifies movie genres using multimodal data.

problem Challenging task of multi-label movie genre classification.
method Created dataset from video clips, subtitles, synopses, and posters. Extracted features using various descriptors. Evaluated using different classifiers and late fusion strategy.
result Best F-Score result of 0.628 achieved by combining LSTM on synopses and CNN on movie trailer frames.

A movie multilayer network model captures narration from script, subtitles, and content.

problem Discovering content and stories in movies using network models.
method Developed a multilayer network model using visual and textual semantic cues.
result Demonstrated the effectiveness of the model on the Star Wars saga.

'There is no terror in the bang, only is the anticipation of it' - Alfred Hitchcock. Yet there is everything in correctly anticipating the bang a movie would make in the box-office. Movies make a high profile, billion dollar industry and prediction of movie revenue can be very lucrative. Predicted revenues can be used …

2018-04-03abs ↗pdf ↗

A shadow diagram is a knot diagram with under-over information omitted; a shadow movie is a sequence of shadow diagrams related by shadow Reidemeister moves. We show that not every shadow movie arises as the shadow of a Reidemeister movie, meaning a sequence of classical knot diagrams related by classical Reidemeister …

2011-06-17abs ↗pdf ↗

Two singular links are cobordant if one can be obtained from the other by singular link isotopy together with a combination of births or deaths of simple unknotted curves, and saddle point transformations. A movie description of a singular link cobordism in 4-space is a sequence of singular link diagrams obtained from …

2015-07-15abs ↗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 ↗

In today's day and age when almost every industry has an online presence with users interacting in online marketplaces, personalized recommendations have become quite important. Traditionally, the problem of collaborative filtering has been tackled using Matrix Factorization which is linear in nature. We extend the wor…

2018-07-14abs ↗pdf ↗

Study analyzes IMDB movie comments and Twitter data using machine learning and vector space techniques.

problem Sentiment analysis of IMDB movie comments and Twitter data.
method Created a vector space in KNIME Analytics platform, used Decision Trees, Naïve Bayes, and SVM algorithms for classification.
result SVM algorithm provided the best classification results for both IMDB movie comments and Twitter data sets.

Solves the film scheduling and staggered showtimes problem for movie theaters.

problem Maximize attendance and revenue by scheduling films with staggered showtimes.
method Binary integer linear optimization to find optimal schedules for each cluster of neighboring locations.
result Optimal scheduling cannot be done for all locations at once, but must be done for each cluster.

Adapting momentum from optimization to reinforcement learning.

problem Improving the convergence and stability of reinforcement learning algorithms.
method Introducing Momentum Value Iteration (MoVI) by incorporating an average of consecutive state-action value functions, inspired by the concept of momentum in optimization.
result MoVI improves the convergence and stability of reinforcement learning algorithms, as demonstrated by experiments on Atari games.

This project explores several Machine Learning methods to predict movie genres based on plot summaries. Naive Bayes, Word2Vec+XGBoost and Recurrent Neural Networks are used for text classification, while K-binary transformation, rank method and probabilistic classification with learned probability threshold are employe…

2018-01-15abs ↗pdf ↗

Relational probabilistic models have the challenge of aggregation, where one variable depends on a population of other variables. Consider the problem of predicting gender from movie ratings; this is challenging because the number of movies per user and users per movie can vary greatly. Surprisingly, aggregation is not…

2017-07-25abs ↗pdf ↗

Predict missing movie ratings or graph embeddings with low rank matrices.

problem Predicting missing entries in a ratings matrix or graph embeddings with known linear relations.
method Low rank matrix completion approach applied to graph embeddings.
result Effective methods for predicting missing entries in matrices and graph embeddings.

New procedures connect braid charts, triplane diagrams, and braid movies for knotted surfaces.

problem Understanding the braid index and bridge index of knotted surfaces in 4D.
method Introducing rainbow diagrams and new procedures for passing among triplane diagrams, braid movies, and braid charts.
result Inequalities relating braid index and bridge index of 2-knots are obtained.

Much work has been done in understanding human creativity and defining measures to evaluate creativity. This is necessary mainly for the reason of having an objective and automatic way of quantifying creative artifacts. In this work, we propose a regression-based learning framework which takes into account quantitative…

2017-07-18abs ↗pdf ↗

Study shows pruning datasets can improve machine learning model performance.

problem Improving machine learning model performance through dataset pruning.
method Comparison of different algorithms on unpruned and iteratively pruned datasets.
result Algorithms that perform better on unpruned datasets also perform better on pruned datasets.

The paper extends surface link coloring theory to triplane diagrams and knots.

problem Understanding the topological properties of knots and surfaces in 4-space.
method Translated Niebrzydowski's theory of region colorings to triplane diagrams and movies of knots, providing inequalities and applications.
result Yoshikawa's 2-knots 919_1 and 10210_2 are non-invertible.

We use deep learning to model interactions across two or more sets of objects, such as user-movie ratings, protein-drug bindings, or ternary user-item-tag interactions. The canonical representation of such interactions is a matrix (or a higher-dimensional tensor) with an exchangeability property: the encoding's meaning…

2018-03-07abs ↗pdf ↗

Study nondegenerate fibrations of Euclidean spaces and their relation to sphere fibrations.

problem Classify and understand nondegenerate fibrations of Euclidean spaces.
method Topological and geometric analysis of nondegenerate fibrations, including continuity at infinity.
result Prove that every germ of a nondegenerate fibration extends to a global fibration.

Singular fibrations over surfaces generalize Lefschetz fibrations and have new construction methods.

problem Understanding and constructing singular fibrations over surfaces.
method Explains how to construct examples of singular fibrations with a single singularity and outlines previous results.
result Closed orientable 4-manifolds with large first Betti number and vanishing second Betti number do not admit singular fibrations.

Third in a series, this paper constructs non-trivial Cayley fibrations with conical singularities.

problem Constructing non-trivial Cayley fibrations with conical singularities.
method Using gluing methods and stability results for weak and usual fibrations.
result Construction of examples of Cayley fibrations on twisted connected sum G2G_2 manifolds.

Distributions over rankings are used to model data in various settings such as preference analysis and political elections. The factorial size of the space of rankings, however, typically forces one to make structural assumptions, such as smoothness, sparsity, or probabilistic independence about these underlying distri…

2012-02-14abs ↗pdf ↗

Auroux, Donaldson and Katzarkov introduced broken Lefschetz fibrations as a generalization of Lefshcetz fibrations in order to describe near-symplectic 4-manifolds. We first study monodromy representations of higher sides of genus-1 simplified broken Lefschetz fibrations. We then completely classify diffeomorphism type…

2010-12-18abs ↗pdf ↗

New ROC tools assess predictive abilities for any linearly ordered outcomes.

problem Fundamental restriction in ROC analysis for non-dichotomous outcomes.
method ROC movies and UROC curves for linearly ordered outcomes.
result CPA equals AUC for binary outcomes and relates to Spearman's coefficient for pairwise distinct outcomes.

This paper presents a novel model for multimodal learning based on gated neural networks. The Gated Multimodal Unit (GMU) model is intended to be used as an internal unit in a neural network architecture whose purpose is to find an intermediate representation based on a combination of data from different modalities. Th…

2017-02-07abs ↗pdf ↗