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

Trend · papers per month

2356 · May 201919922001200920172026
48 results for movie trailers

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.

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 ↗

'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 ↗

As more and more people shift their movie watching online, competition between movie viewing websites are getting more and more intense. Therefore, it has become incredibly important to accurately predict a given user's watching list to maximize the chances of keeping the user on the platform. Recent studies have sugge…

2019-09-02abs ↗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 ↗

We adapt the optimization's concept of momentum to reinforcement learning. Seeing the state-action value functions as an analog to the gradients in optimization, we interpret momentum as an average of consecutive qq-functions. We derive Momentum Value Iteration (MoVI), a variation of Value Iteration that incorporates …

2019-10-21abs ↗pdf ↗

The left-invariant sub-Riemannian problem on the Engel group is considered. The problem gives the nilpotent approximation to generic nonholonomic systems in four-dimensional space with two-dimensional control, for instance to a system which describes motion of mobile robot with a trailer. The global optimality of extre…

2014-08-28abs ↗pdf ↗

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 ↗

We generalize the notion of planar bicycle tracks -- a.k.a. one-trailer systems -- to so-called tractor/tractrix systems in general Riemannian manifolds and prove explicit expressions for the length of the ensuing tractrices and for the area of the domains that are swept out by any given tractor/tractrix system. These …

2017-07-29abs ↗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 ↗

New Lie systems derived from Goursat distributions with applications to differential equations.

problem Analyzing Lie systems associated with Goursat distributions and their applications.
method Analyzing bracket-generating distributions and their relation to Lie systems, focusing on reductions and reconstructions.
result Lie systems associated with Goursat distributions can be reduced and solutions reconstructed from reduced systems.

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 ↗

We present 27 problems encountered in automating the translation of movie/TV show subtitles. We categorize each problem in one of the three categories viz. problems directly related to textual translation, problems related to subtitle creation guidelines, and problems due to adaptability of machine translation (MT) eng…

2019-09-04abs ↗pdf ↗

We show that if KK is a fibered ribbon knot in S3=B4S^3=\partial B^4 bounding a ribbon disk DD, then given an extra transversality condition the fibration on S3ν(K)S^3\setminusν(K) extends to a fibration of B4ν(D)B^4\setminusν(D). This partially answers a question of Casson and Gordon. In particular, we show the fibration alway…

2018-11-23abs ↗pdf ↗

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 ↗

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 ↗

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 ↗

This paper reports on our analysis of the 2011 CAMRa Challenge dataset (Track 2) for context-aware movie recommendation systems. The train dataset comprises 4,536,891 ratings provided by 171,670 users on 23,974$ movies, as well as the household groupings of a subset of the users. The test dataset comprises 5,450 rating…

2012-07-26abs ↗pdf ↗

ANT learns sparse embeddings for large vocabularies efficiently.

problem Lack of scalable methods for embedding large vocabularies in neural networks.
method Anchor & Transform (ANT) algorithm that learns a small set of anchor embeddings and a sparse transformation matrix.
result ANT achieves stronger performance with fewer parameters (up to 40x compression) compared to existing methods.

Dataset pruning is the process of removing sub-optimal tuples from a dataset to improve the learning of a machine learning model. In this paper, we compared the performance of different algorithms, first on an unpruned dataset and then on an iteratively pruned dataset. The goal was to understand whether an algorithm (s…

2019-01-11abs ↗pdf ↗

Recommending items to users is a challenging task due to the large amount of missing information. In many cases, the data solely consist of ratings or tags voluntarily contributed by each user on a very limited subset of the available items, so that most of the data of potential interest is actually missing. Current ap…

2015-09-30abs ↗pdf ↗