Large-scale datasets have played a significant role in progress of neural network and deep learning areas. YouTube-8M is such a benchmark dataset for general multi-label video classification. It was created from over 7 million YouTube videos (450,000 hours of video) and includes video labels from a vocabulary of 4716 c…
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
48 results for “Youtube Dataset”
The study explains YouTube commenters' behavior using rational inattention models.
problem Understanding and predicting YouTube commenters' behavior.
method Deep embedded clustering for user grouping, Bayesian revealed preferences for rationality testing, and behavioral economics constraints for attention span modeling.
result Most YouTube user groups optimize a Bayesian utility with rationally inattentive constraints.
Novel Machine Learning Algorithms for Centrality and Cliques Detection in Youtube Social Networkscs.LG
Research uses machine learning to find central nodes and cliques in YouTube social networks.
problem Identifying central nodes and cliques in YouTube social networks.
method Unsupervised machine learning, Python programming, Bron-Kerbosch algorithm.
result Successfully found central nodes through clique-centrality and degree centrality.
This paper introduces the YouTube-8M Video Understanding Challenge hosted as a Kaggle competition and also describes my approach to experimenting with various models. For each of my experiments, I provide the score result as well as possible improvements to be made. Towards the end of the paper, I discuss the various e…
Neural M3 model adapts to diverse user behaviors over short and long timeframes.
problem Adapting to diverse user behaviors over short and long timeframes.
method Neural Multi-temporal-range Mixture Model (M3) combining short-term and long-term models with a learned gating mechanism.
result M3 consistently outperforms state-of-the-art sequential recommendation methods.
A dataset for detecting online hate speech from YouTube and Reddit comments.
problem Detecting and preventing hate speech on social media platforms.
method Created a dataset with two variants: binary and multi-label, based on YouTube and Reddit comments, using Figure-Eight crowdsourcing platform.
result Demonstrated that even a small amount of labelled data can help detect hate speech occurrences.
System filters inappropriate YouTube content for advertisers.
problem Inadequate detection of inappropriate content on YouTube ads.
method Proposes a system for identifying and filtering inappropriate content.
result Current countermeasures are ineffective in detecting inappropriate content.
YouTube presents an unprecedented opportunity to explore how machine learning methods can improve healthcare information dissemination. We propose an interdisciplinary lens that synthesizes machine learning methods with healthcare informatics themes to address the critical issue of developing a scalable algorithmic sol…
We present a solution to "Google Cloud and YouTube-8M Video Understanding Challenge" that ranked 5th place. The proposed model is an ensemble of three model families, two frame level and one video level. The training was performed on augmented dataset, with cross validation.
Information Content of Financial Youtube Channel: Case Study of 3PROTV and Korean Stock Marketq-fin.PM
Study finds financial YouTube channel 3PROTV predicts stock market performance and sentiment changes.
problem Determining the informational value of financial YouTube channels.
method Analyzing 3PROTV's content and its impact on stock market performance and sentiment.
result 3PROTV's content, particularly negative sentiment, predicts stock market performance and sentiment changes.
FSD50K provides an open dataset of over 51k audio clips for sound event recognition.
problem Small and domain-specific sound event recognition datasets.
method Creation of an open dataset with over 51k audio clips manually labeled using 200 classes.
result FSD50K is a new open benchmark for sound event recognition research.
The paper solves IRL for Bayesian stopping time problems.
problem Identifying optimal actions in Bayesian stopping time problems.
method Novel IRL framework using Bayesian revealed preferences.
result Identifies optimality and constructs cost function estimates.
We consider a framework involving behavioral economics and machine learning. Rationally inattentive Bayesian agents make decisions based on their posterior distribution, utility function and information acquisition cost Renyi divergence which generalizes Shannon mutual information). By observing these decisions, how ca…
Proposes TDNs for learning complex video structures.
problem Complex temporal dependencies in sequential data, especially videos.
method Temporal Dependency Networks (TDNs) using graph representations and graph convolutions.
result Efficiently learns complex semantic structures of video data.
This study uses AI to analyze financial market coverage from YouTube videos.
problem Challenges in analyzing a large number of financial market videos.
method Used Whisper model to generate text from videos, applied natural language processing.
result Highlights dynamics of financial market coverage and identifies trending topics.
See http://www.youtube.com/watch?v=izbGXdjvK_I for a YouTube video showing part of the results in this paper.We will consider surfaces whose mean curvature at a point is a linear function of the square of the distance from that point to the vertical axis. We restrict ourselves here to surfaces which are cylinders over …
Estimates LRD in sequential data, improving RNNs.
problem Quantifying LRD in sequential data for better RNNs.
method Principled estimation procedure based on LRD theory for real-valued time series.
result Estimates LRD reliably in user behavior and Wikipedia article writing.
VoxCeleb 2019 challenge assesses speaker recognition in uncontrolled settings.
problem Evaluate speaker recognition technology in unconstrained data.
method Public dataset, challenge, and workshop at Interspeech 2019.
result Baseline results and discussions provided.
Study builds tools to detect misinformation in online medical videos.
problem Misleading information in online medical videos.
method Manual annotation of a dataset, use of linguistic, acoustic, and user engagement features for classification models.
result Automatic models can identify misinformation with up to 74% accuracy.
Proposes a deep learning model for timely and accurate recommendations.
problem Inability to provide timely recommendations and ranking issues with implicit feedback.
method Unified cross-network solution using listwise ranking for implicit data.
result Superior performance in accuracy, novelty, and diversity compared to baselines.
Transformer autoencoder learns musical style from performances.
problem Learning high-level controls over symbolic music generation.
method Aggregates encodings of input data across time to obtain global style representation.
result Improves control over performance style and melody in music generation tasks.
Study shows image classifiers struggle with temporal changes in videos.
problem Temporal robustness of image classifiers in videos.
method Constructed datasets and evaluated various classifiers and detection models.
result Median classification accuracy drops of 16-10 points in robust datasets.
Understanding and predicting the popularity of online items is an important open problem in social media analysis. Considerable progress has been made recently in data-driven predictions, and in linking popularity to external promotions. However, the existing methods typically focus on a single source of external influ…
Adversarial attacks can fool copyright detection systems.
problem Vulnerability of copyright detection systems to adversarial attacks.
method Used gradient methods to create adversarial music that fooled detection systems.
result Adversarial attacks can successfully deceive industrial copyright detection tools.
Graph spectra have been successfully used to classify network types, compute the similarity between graphs, and determine the number of communities in a network. For large graphs, where an eigen-decomposition is infeasible, iterative moment matched approximations to the spectra and kernel smoothing are typically used. …
Deep reinforcement learning methods traditionally struggle with tasks where environment rewards are particularly sparse. One successful method of guiding exploration in these domains is to imitate trajectories provided by a human demonstrator. However, these demonstrations are typically collected under artificial condi…
The Variational Homoencoder: Learning to learn high capacity generative models from few examplescs.LG
Hierarchical Bayesian methods can unify many related tasks (e.g. k-shot classification, conditional and unconditional generation) as inference within a single generative model. However, when this generative model is expressed as a powerful neural network such as a PixelCNN, we show that existing learning techniques typ…
New RL method learns from passive data by modeling intentions.
problem Learning from passive data like videos without rewards or actions.
method Model intentions using temporal difference learning, learning representations from raw data.
result Successfully learns features from passive data that accelerate downstream RL tasks.
Elastic-InfoGAN learns object identity in class-imbalanced data.
problem Learning disentangled representations in class-imbalanced data.
method Invariance to identity-preserving transformations to learn object identity.
result Effectiveness in disentangling object identity in imbalanced datasets.
New algorithm disentangles latent space in GANs using video sequences.
problem Learning disentangled latent spaces in GANs without supervision.
method Adversarial training with video sequences, modifying standard GAN algorithm.
result Disentangled latent space into content and motion attributes.
Industrial recommender systems deal with extremely large action spaces -- many millions of items to recommend. Moreover, they need to serve billions of users, who are unique at any point in time, making a complex user state space. Luckily, huge quantities of logged implicit feedback (e.g., user clicks, dwell time) are …
A new method improves recommendation accuracy by learning from multiple networks and time-dependent user preferences.
problem Incomplete user profiles and dynamic user preferences degrade recommender quality.
method A cross-network time-aware recommender that learns from multiple source networks and develops current user models.
result The proposed solution achieves superior performance in accuracy, novelty, and diversity.
The Clifford group for 2 qubits is divided into 20 orbits, each with 4608 matrices.
problem Understanding the structure of the Clifford group for 2 qubits.
method Equivalence relation based on local Clifford gates and analysis of orbits.
result The Clifford group for 2 qubits is divided into 20 orbits, each with 4608 matrices.
New graph representation learning network improves scalability and feature integration.
problem Scalability and feature integration in graph neural networks for large, dense graphs.
method Adaptive sampling of neighbours based on weighted multi-step transition probabilities.
result Comparable or better results on various graph benchmarks.
Unsupervised methods have proven effective for discriminative tasks in a single-modality scenario. In this paper, we present a multimodal framework for learning sparse representations that can capture semantic correlation between modalities. The framework can model relationships at a higher level by forcing the shared …
The Flag Median and FlagIRLSstat.ML
New subspace prototype flag median improves clustering on noisy data.
problem Finding robust prototypes for datasets of images and videos.
method Proposes flag median and introduces FlagIRLS algorithm for its calculation.
result Flag median is robust to outliers and improves cluster purity.
CB-GLNs learn video data's complex dependencies via graph representation.
problem Capturing complex dependency structures in sequential data like videos.
method Represent video data as a graph, find compositional dependencies via graph-cut and message passing.
result CB-GLNs efficiently learn video data's semantic compositional structure.
In this paper we define a small variation of the Taylor method and a formula for the global error of this new numerical method that allows us to keep track of the round-off error and does not require previous knowledge of the exact solution. As an application we provide a rigorous proof of the construction/existence of…
Constant Speed Rampsmath.DG
In this paper we show all possible ramps where an object can move with constant speed under the effect of gravity and friction. The planar ramp are very easy to describe, just rotate a curve with velocity vector (tanh(as),sech(as)). Recall that tanh(as)^2+sech^2(as) = 1. Therefore, the solution of the planar constant s…
Grale designs graphs for graph learning, improving performance on large datasets.
problem Finding the right graph for semi-supervised learning with billions of nodes.
method Fuses multiple similarity measures using locality sensitive hashing to create task-specific graphs.
result Grale detects a large number of malicious actors, increasing recall by 89%.
The front-end factor analysis (FEFA), an extension of principal component analysis (PPCA) tailored to be used with Gaussian mixture models (GMMs), is currently the prevalent approach to extract compact utterance-level features (i-vectors) for automatic speaker verification (ASV) systems. Little research has been conduc…
In this paper, we introduce a methodology that allows to model behavioral trajectories of users in online social media. First, we illustrate how to leverage the probabilistic framework provided by Hidden Markov Models (HMMs) to represent users by embedding the temporal sequences of actions they performed online. We the…
The paper establishes CLTs for Markov chains and improves sampling algorithms for heavy-tailed distributions.
problem Establishing central limit theorems for ergodic averages of Markov chains.
method Drift conditions to provide necessary and sufficient conditions for CLTs, including lower bounds on convergence rates.
result Sharp conditions and convergence rates for various MCMC algorithms on heavy-tailed targets.
New algorithm poLinUCB improves online learning in content recommendation platforms.
problem Improving efficiency in content recommendation platforms with post-serving context.
method Novel contextual bandit problem with post-serving contexts and a new algorithm, poLinUCB.
result Achieves tight regret under standard assumptions and significant benefit of utilizing post-serving contexts.
On the effectiveness of convolutional autoencoders on image-based personalized recommender systemscs.LG
Convolutional autoencoders improve personalized recommendations from image-based data.
problem Lack of personalized recommendations in gastronomic platforms using image data.
method Used convolutional autoencoders to extract features from images and improve personalized recommendations.
result Convolutional autoencoders outperform standard deep features in image-based personalized recommendation systems.
Deep learning approximates shortest path distances in large graphs.
problem Scaling up shortest path distance computation in large networks.
method Deep learning techniques to approximate distances using vector embeddings.
result Feedforward neural networks with embeddings can approximate distances with low distortion error.
In this paper, we deal with two challenges for measuring the similarity of the subject identities in practical video-based face recognition - the variation of the head pose in uncontrolled environments and the computational expense of processing videos. Since the frame-wise feature mean is unable to characterize the po…
Lattice Rescoring Strategies for Long Short Term Memory Language Models in Speech Recognitionstat.ML
Recurrent neural network (RNN) language models (LMs) and Long Short Term Memory (LSTM) LMs, a variant of RNN LMs, have been shown to outperform traditional N-gram LMs on speech recognition tasks. However, these models are computationally more expensive than N-gram LMs for decoding, and thus, challenging to integrate in…