New PCGML approach generates novel game content across multiple platformer domains.
problem Generating novel game content in new domains.
method Using a new affordance and path vocabulary, variational autoencoders trained on data from six platformer games produce new content with varying proportions of different domains.
result Captures latent level space spanning multiple domains and generates new content with varying proportions of different domains.
Reinforcement learning improves game level design.
problem Creating high-quality game levels with limited examples.
method Transforming level design into a Markov decision process and training with reinforcement learning.
result Trained reinforcement learning agents can generate high-quality levels quickly.
Kernel Mean Matching enhances GANs for content-addressable generation.
problem Creating models that can generate images consistent with specified examples.
method Kernel Mean Matching applied to GANs.
result The method generates images consistent with specified input sets while maintaining original model quality.
A new approach to PCGML uses discriminative models to improve design control.
problem Fundamental tension between detailed training examples and return on investment.
method Discriminative models trained on positive and negative examples.
result Demonstrates new mode of control for learning-based generators.
We quantify content availability and user discovery opportunities in recommender systems.
problem Determining the maximum probability of recommending content to users.
method Stochastic reachability to compute upper bounds on recommendation likelihood.
result Reachability metrics can detect biases and diagnose user discovery limitations.
Procgen Benchmark uses procedurally generated games to test reinforcement learning.
problem Lack of diverse and high-quality training environments for reinforcement learning.
method Developed 16 procedurally generated game-like environments and used them to benchmark reinforcement learning.
result Procedurally generated environments are essential for training and evaluating reinforcement learning agents.
TOAD-GAN generates coherent game levels from a single example.
problem Creating game levels from a single example.
method Token-based Procedural Content Generation (PCG) using SinGAN architecture.
result Achieves state-of-the-art results in generating coherent levels of similar style.
Model disentangles font content and style.
problem Analyzing and reconstructing fonts.
method Variational inference and asymmetric transpose convolutional process.
result Model outperforms state-of-the-art models in font reconstruction.
Rogue-Gym tests RL agents' generalization in procedurally generated dungeons.
problem Overfitting in RL agents in different environments.
method Proposes Rogue-Gym, a roguelike game for evaluating RL generalization.
result Some RL enhancements fail to improve generalization in Rogue-Gym.
We present a Bayesian nonparametric framework for multilevel clustering which utilizes group-level context information to simultaneously discover low-dimensional structures of the group contents and partitions groups into clusters. Using the Dirichlet process as the building block, our model constructs a product base-m…
DAM with MRL improves relational reasoning in MANNs.
problem Limited performance of associative memory networks on complex relational reasoning tasks.
method Distributed Associative Memory architecture with Memory Refreshing Loss.
result Enhanced relation reasoning performance of MANNs on long temporal sequence data.
A new framework converts EEG signals between subjects and tasks.
problem Noise and variability in EEG data hinder generalizable signal extraction.
method Contrastive Split-Latent Permutation Autoencoder (CSLP-AE) framework.
result The CSLP-AE framework enables zero-shot conversion between unseen subjects.
New model learns content and transformation separately from data.
problem Learning disentangled representations from data without explicit labels.
method Group-based variational autoencoders, assuming content and transformation groups.
result Model learns generalizable content representations from unseen data.
For the pedestrian observer, financial markets look completely random with erratic and uncontrollable behavior. To a large extend, this is correct. At first approximation the difference between real price changes and the random walk model is too small to be detected using traditional time series analysis. However, we s…
New concept of epiplexity quantifies useful information from data.
problem Understanding useful information content from data without unlimited computational capacity.
method Introducing epiplexity, a measure of information computationally bounded observers can learn.
result Epiplexity captures useful information content, not just randomness.
Study shows online learning algorithms incentivize low-quality content, proposing new algorithms to improve quality.
problem Online learning algorithms in content recommender systems incentivize producers to create low-quality content.
method Analyzed the game between producers and content quality, designed new learning algorithms to incentivize high effort and quality.
result New algorithms incentivize producers to invest high effort and achieve high user welfare, improving content quality.
Transforms web content for better visibility in AI-driven search engines.
problem Disruption of traditional SEO by generative AI search engines.
method Fine-tunes a BART-base transformer on synthetically generated training data.
result Significant improvements in ROUGE-L and BLEU scores, and substantial visibility gains in generative search responses.
Method recombines image content and style from different images.
problem Recombining image content and style from different images.
method Constructs content embedding, uses VAE with leakage filtering to ensure separation of style and content.
result Synthesizes novel images with state-of-the-art performance on few-shot learning tasks.
Improves information cascade models using contrastive training and DSTs.
problem Improving models of information cascades using limited labeled data.
method Proposes a contrastive training procedure for models of information cascades as directed spanning trees (DSTs).
result Unsupervised training with additional content features achieves significantly better results, reaching half the accuracy of a fully supervised model.
MIXGAN combines concepts from different domains for new image generation.
problem Generating new images with mixed content and style from different domains.
method MIXGAN is a mixture generative adversarial network that learns content and style from two domains and generates new images combining them.
result MIXGAN effectively generates new images with mixed content and style from different domains.
Custom loss functions improve accuracy of wildfire rate of spread forecasts.
problem Improving accuracy of wildfire rate of spread forecasts.
method Examined custom loss functions in machine learning models of fuel moisture content.
result Custom loss functions improved accuracy of ROS forecasts by a small amount.
This work improves disentanglement by preventing style variables from encoding content-related features.
problem Disentanglement of content and style in data representations using Variational Autoencoders.
method Adversarial training with mutual information minimization to prevent content information leakage in style representations.
result The method efficiently separates content and style related attributes and generalizes to unseen data.
Efficiently transfers style to content without distorting the content structure.
problem Arbitrary style transfer in computer vision.
method Rigid alignment of style features to content features.
result High-quality stylized images with intact content structure.
Generates text with specified attributes, improving content compatibility.
problem Modifying textual attributes of sentences while maintaining content compatibility.
method Introduces reconstruction and adversarial losses to generate attribute-compatible, realistic sentences.
result Demonstrates superior content compatibility and attribute control compared to prior methods.
Classifies domains critical for heat content and exit-time moments.
problem Understanding critical domains for heat content and exit-time moments.
method First variation of heat content, constant flow property, isoparametric foliation.
result Domains critical for heat content at all times have constant flow property and isoparametric foliation.
Improves content allocation in educational platforms with sparse data.
problem Imbalanced content allocation and delayed convergence in adaptive strategies.
method Introduces WAPTS, an algorithm that refines Thompson Sampling for data-sparse environments.
result Demonstrates earlier and more reliable identification of promising treatments.
Simple method disentangles content and style from pre-trained vision models.
problem Learning interpretable features in visual representations.
method Probabilistic linear entanglement model and simple disentanglement algorithm.
result Method provably disentangles content and style features.
Proposes a model to optimize feedback for content creators on social media.
problem Nurturing content creation on social media platforms.
method Modeling feedback distribution to incentivize creators and optimize newsfeed experience.
result Optimized newsfeed for content creators without compromising user experience.
Proposes a VAE variant for ordinal content factors.
problem Isolating ordinal-valued content factors in deep latent variable models.
method Introduces a partially ordered set (poset) structure and a conditional Gaussian spacing prior model.
result Significant improvements in content-style separation over previous non-ordinal approaches.
We obtain upper bounds on the heat content and on the torsional rigidity of a complete Riemannian manifold M, assuming a generalized Hardy inequality for the Dirichlet Laplacian on M.
Mathematical model audits social media algorithms to prevent bias.
problem Algorithmic filtering can bias users' decisions and societal norms.
method Formalized mathematical framework for auditing social media algorithms.
result Data-driven statistical auditing procedure to regulate algorithmic bias.
Method interprets GAN latent space via latent variable correlation analysis.
problem Understanding the inner workings of GANs.
method Analyzing correlation between latent variables and semantic contents in generated images.
result A method for controllable semantic content generation in GANs.
This research predicts the popularity of new video contents using a hybrid machine learning approach.
problem Predicting the popularity of new video contents before they are published.
method Hybrid machine learning approach combining XGBoosting and deep neural nets, using metadata and categorical embedding techniques.
result Achieved better performance than standalone methods, validated on a dataset from a top streaming service.
Data science predicts user interest for midwifery content.
problem Improving midwives' learning and preventing maternal and newborn deaths.
method Forecasting methods using user-generated logs from online learning apps.
result Determining future user interest in midwifery content types.
Recommender systems leverage product and community information to target products to consumers. Researchers have developed collaborative recommenders, content-based recommenders, and (largely ad-hoc) hybrid systems. We propose a unified probabilistic framework for merging collaborative and content-based recommendations…
Preserves content while changing style in text.
problem Text style transfer often fails to preserve content.
method Leverages linguistic information in structured supervisions.
result Significant improvement in content preservation and style transfer.
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.
Many businesses are using recommender systems for marketing outreach. Recommendation algorithms can be either based on content or driven by collaborative filtering. We study different ways to incorporate content information directly into the matrix factorization approach of collaborative filtering. These content-booste…
Spotify improves content mix using contextual bandits.
problem Skewed historical data and varying user preferences across contexts.
method Contextual bandits to dynamically learn optimal content type distribution.
result Improved precision and user engagement with under-represented content types.
A new model considers fatigue in online content recommendation systems.
problem Fatigue in users due to overexposure and boredom from similar recommendations.
method Proposed a fatigue-aware Dependent Click Model (DCM) and two learning algorithms.
result Developed algorithms with regret bounds for learning content relevance and fatigue effects.
New study shows personalized content recommendations can lead to polarization of user preferences.
problem Personalized content recommendations can alter user preferences, leading to polarization.
method Used a model of preference dynamics to explore how personalized content affects user preferences.
result Standard reward maximization algorithms achieve only constant regret in personalized recommendation environments.
We present in modern language the contents of the famous note published by Henri Poincaré in 1901 "Sur une forme nouvelle des équations de la Mécanique", in which he proves that, when a Lie algebra acts locally transitively on the configuration space of a Lagrangian mechanical system, the well known Euler-Lagrange equa…
Paper proposes online learning for estimating AC network admittance matrix.
problem Missing or outdated information on power grid topology and parameters.
method Recursive identification algorithm using phasor measurements, enhanced with DOE for optimal data excitation.
result Improves on existing techniques and substantiated by numerical studies.
We develop a novel "decouple-recouple" dynamic predictive strategy and contribute to the literature on forecasting and economic decision making in a data-rich environment. Under this framework, clusters of predictors generate different latent states in the form of predictive densities that are later synthesized within …
Hybrid methods that utilize both content and rating information are commonly used in many recommender systems. However, most of them use either handcrafted features or the bag-of-words representation as a surrogate for the content information but they are neither effective nor natural enough. To address this problem, w…
A new approach uses deep learning to manage vehicular content efficiently.
problem Managing content replication and caching in vehicular networks efficiently.
method Data-driven, centralized approach using a Convolutional Neural Network (CNN).
result Effective strategies derived to modulate FC operation in space and adapt to mobility changes.
Study on heat content for submanifolds in sub-Riemannian geometry.
problem Understanding heat content for submanifolds in sub-Riemannian geometry.
method Existence of smooth tubular neighborhood, definition of relative heat content, approximation via smooth neighborhoods, asymptotic expansion analysis.
result Approximation of relative heat content fails to recover the exact expansion.
With rapid development of the Internet, web contents become huge. Most of the websites are publicly available, and anyone can access the contents from anywhere such as workplace, home and even schools. Nevertheless, not all the web contents are appropriate for all users, especially children. An example of these content…