Enhances content moderation with culturally-aware models.
problem Global content moderation policies miss local cultural nuances.
method Fine-tuning encoder-decoder models on media-diet data.
result Improved accuracy in local violation detection and cultural alignment.
Improves accuracy and fairness in prediction systems with multiple domain experts.
problem Designing unbiased and accurate deferral systems with multiple experts.
method Proposes a framework for learning a classifier and deferral system that chooses to defer to multiple human experts.
result Significantly improves accuracy and fairness of final predictions compared to baselines.
Modeling incentives for content creators on algorithm-curated platforms.
problem Maximizing exposure for content creators on algorithmic platforms.
method Formalized exposure game model, proving effects of algorithmic choices on equilibria, proposing tools for finding equilibria.
result Algorithmic choices significantly affect content exposure and creator behavior.
Community moderation drifts towards majority, study finds.
problem How to ensure crowd-sourced moderation systems trust and reward accurate evaluations.
method Consensus-based auditing with a two-stage algorithm that weights contributors by the stability of their past residuals.
result Minority contributors' evaluations drift towards the majority, and their participation share falls on controversial topics.
Gradient-based algorithm improves model performance with triage.
problem Improving model accuracy with human expert involvement.
method Formal characterization of triage, optimal triage policy as deterministic threshold rule, gradient-based algorithm.
result Gradient-based algorithm finds triage policies and models with increasing performance.
A framework for optimizing prompt selection in generative language models.
problem Efficiently selecting prompts for generative language models.
method Two-stage framework using simulation optimization to maximize a pre-defined score.
result Consistency of the sequential evaluation procedure in the proposed framework.
Forums play an important role in providing a platform for community interaction. The introduction of irrelevant content or spam by individuals for commercial and social gains tends to degrade the professional experience presented to the forum users. Automated moderation of the relevancy of posted content is desired. Ma…
Study uses machine learning to predict soil organic carbon content in northern Iran.
problem Estimating soil organic carbon content for understanding soil functions.
method Applied machine learning algorithms including DNN, SVM, ANN, etc., with genetic algorithm feature selection.
result DNN model showed highest accuracy with low prediction error and uncertainty.
Bayesian method improves reliability of BERT for hate speech detection.
problem Reliable detection of hate speech in user-generated content.
method Bayesian approach using Monte Carlo dropout in transformer models.
result Monte Carlo dropout provides well-calibrated reliability estimates.
Proposes a method for interpreting time-varying causal effect moderation in high-dimensional data.
problem Interpreting causal effect moderation in high-dimensional data with interpretability and avoiding false positives.
method Two-step method: 1) Selects a smaller model for linear causal effect moderation using Gaussian randomization, 2) Conditions on selection to construct a pivot for uniformly asymptotic semi-parametric inference.
result Consistently achieves valid coverage rates and shorter, bounded intervals in time-varying causal effect moderation.
A dataset for evaluating engagement with scientific video lectures.
problem Challenges in managing learning resources due to rapid creation of video lectures.
method Introduction of VLEngagement dataset with content-based and video-specific features, and metrics related to user engagement.
result The largest and most diverse publicly available dataset for understanding context-agnostic engagement in video lectures.
New lower bounds show challenges in clustering in moderate dimensions.
problem Clustering points from mixtures of isotropic Gaussians in moderate dimensions.
method Established low-degree polynomial lower bounds and developed a novel non-spectral algorithm.
result New lower bounds reveal a 'non-parametric rate' in moderate dimensions.
Optimizes variance reduction in Heston model using large and moderate deviations.
problem Improving variance reduction in stochastic volatility models.
method Large and moderate deviations theory applied to Heston model.
result Derives closed-form solutions for optimal change of measure.
Importance sampling has become an important tool for the computation of tail-based risk measures. Since such quantities are often determined mainly by rare events standard Monte Carlo can be inefficient and importance sampling provides a way to speed up computations. This paper considers moderate deviations for the wei…
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.
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.
Sensory data are often comprised of independent content and transformation factors. For example, face images may have shapes as content and poses as transformation. To infer separately these factors from given data, various ``disentangling'' models have been proposed. However, many of these are supervised or semi-super…
In this paper, we propose a phase shift deep neural network (PhaseDNN) which provides a wideband convergence in approximating a high dimensional function during its training of the network. The PhaseDNN utilizes the fact that many DNN achieves convergence in the low frequency range first, thus, a series of moderately-s…
We extend previous large deviations results for the randomised Heston model to the case of moderate deviations. The proofs involve the Gärtner-Ellis theorem and sharp large deviations tools.
Optimal learning via moderate deviations theory improves statistical accuracy.
problem Statistical estimation of expected loss in various models.
method Develops confidence intervals using moderate deviation principle.
result Proposed confidence intervals are statistically optimal.
Computes invariants distinguishing between immersions and embeddings of doodles and blobs on surfaces.
problem Distinguishing between immersions and embeddings of doodles and blobs on surfaces.
method Regular embeddings, bordisms, and exact sequences of abelian groups.
result Exact sequence describing bordisms of immersions and embeddings of doodles on A=RimesI. New method interprets deep learning for causal effects, separating prognostic and moderating covariates.
problem Estimating individual causal/treatment effects under confounders.
method Deep counterfactual learning architecture for estimating CATE with interpretable score functions.
result Demonstrated improved interpretability and quantification of uncertainty in CATE estimation.
We provide a unifying treatment of pathwise moderate deviations for models commonly used in financial applications, and for related integrated functionals. Suitable scaling allows us to transfer these results into small-time, large-time and tail asymptotics for diffusions, as well as for option prices and realised vari…
In the industry of video content providers such as VOD and IPTV, predicting the popularity of video contents in advance is critical not only from a marketing perspective but also from a network optimization perspective. By predicting whether the content will be successful or not in advance, the content file, which is l…
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…
Unified approach to stochastic Volterra systems' deviations.
problem Large and moderate deviations for stochastic Volterra systems.
method Weak convergence approach by Budhijara, Dupuis and Ellis.
result Unified treatment of deviations for a broad class of stochastic Volterra equations.
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.
Stochastic Gradient Descent shows directional bias with moderate learning rates, impacting optimization outcomes.
problem Understanding the bias of SGD with moderate learning rates in practical scenarios.
method Analyzing SGD and GD on an overparameterized linear regression problem.
result SGD converges along large eigenvalue directions, GD along small ones, affecting early stopping outcomes.
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.
We consider visual domains in which a class label specifies the content of an image, and class-irrelevant properties that differentiate instances constitute the style. We present a domain-independent method that permits the open-ended recombination of style of one image with the content of another. Open ended simply me…
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 consider call option prices in diffusion models close to expiry, in an asymptotic regime ("moderately out of the money") that interpolates between the well-studied cases of at-the-money options and out-of-the-money fixed-strike options. First and higher order small-time moderate deviation estimates of call prices an…
A new graph-based clustering method for moderate-dimensional data.
problem Performance degradation of existing graph-based clustering methods in high dimensions.
method Introduces UN-CCDs using NND-based MC-SRT for covering radii determination.
result UN-CCDs provide stable and competitive performance in moderate-sized datasets.
Text style transfer aims to modify the style of a sentence while keeping its content unchanged. Recent style transfer systems often fail to faithfully preserve the content after changing the style. This paper proposes a structured content preserving model that leverages linguistic information in the structured fine-gra…
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…
Decisions are increasingly taken by both humans and machine learning models. However, machine learning models are currently trained for full automation -- they are not aware that some of the decisions may still be taken by humans. In this paper, we take a first step towards the development of machine learning models th…
Much of the data being created on the web contains interactions between users and items. Stochastic blockmodels, and other methods for community detection and clustering of bipartite graphs, can infer latent user communities and latent item clusters from this interaction data. These methods, however, typically ignore t…
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.
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.
New framework reduces strategic manipulation cost for minority groups in fair classification.
problem Strategic manipulation disparities in fair classification.
method Constrained optimization framework that constructs classifiers to reduce strategic manipulation cost for minority groups.
result Empirically, the approach reduces strategic manipulation cost for minority groups over multiple real-world datasets.
Study on heat content for domains with fractal boundaries.
problem Analyzing short-time asymptotics of heat content for domains with fractal boundaries.
method Developing mathematical analysis on de Gennes' hypothesis and exploring fractal curvatures.
result Fractal curvatures and their scaling exponents may emerge in the short-time heat content asymptotics of domains with fractal boundaries.
The paper analyzes the dynamics of tokens in transformer models at moderate interaction levels.
problem Understanding the evolution of tokens in transformer models at moderate interaction levels.
method Modeling transformer models as a system of particles interacting in a mean-field way and studying the corresponding dynamics.
result Characterization and convergence of the limiting dynamics in different phases of the system.
IGSD separates task-specific content channels in transformer components by comparing activation replacement with zero ablation.
problem Mechanistic interpretability of transformer components
method IGSD: paired-intervention framework for comparing activation replacement with zero ablation
result IGSD identifies an early-layer content channel in transformer components that standard importance methods underestimate.
Paper introduces a fraud detection dataset benchmark.
problem Unique challenges in fraud detection datasets.
method Compilation of publicly available fraud datasets.
result Demonstrates applications of the Fraud Dataset Benchmark.