Automatically assesses the quality of online health articles.
problem Lack of automated tools to evaluate the quality of online health information.
method Data mining approach using 10 quality criteria and feature selection.
result Classifier achieved 84%-90% accuracy on 10 criteria.
Bias and heterogeneity in peer assessment can lead to the issue of unfair scoring in the educational field. To deal with this problem, we propose a reference ranking method for an online peer assessment system using HodgeRank. Such a scheme provides instructors with an objective scoring reference based on mathematics.
Recommender system improves recall of omitted foods in online dietary surveys.
problem Improving accuracy of online dietary assessment surveys through recall assistance.
method Developed a recommender algorithm to remind respondents of omitted foods based on past survey data.
result The recommender system captures more omitted foods than hand-coded prompts, but with lower precision.
Study estimates 163 million online freelancers globally.
problem Estimating the number of online workers globally.
method Combining data from various online labour platforms.
result Headline estimate of 163 million registered profiles.
With the deployment of online monitoring systems in distribution networks, massive amounts of data collected through them contains rich information on the operating states of the networks. By leveraging the data, an unsupervised approach based on bidirectional generative adversarial networks (BiGANs) is proposed for op…
Study evaluates human vs. machine review generation, finds human assessments correlate better with lexical overlaps.
problem Evaluating natural language generation models for online reviews is challenging and inconsistent.
method Compared human evaluators with various automated evaluation methods, including discriminative and word overlap metrics.
result Human evaluators do not correlate well with discriminative evaluators, but correlate better with lexical overlaps.
A framework uses POMDPs to assess hierarchical clustering quality.
problem No agreed methodology for evaluating hierarchical clustering without ground-truth labels.
method Modelled as a POMDP, assessing search support for hierarchical structures.
result Proposes a novel measure for assessing hierarchical clustering quality.
Neural nets detect alarming student responses for quick review.
problem Identifying alarming student responses in online assessments.
method Developed neural network models to flag potentially concerning responses.
result Neural nets can flag alarming responses more efficiently than manual review.
Online feature selection has been an active research area in recent years. We propose a novel diverse online feature selection method based on Determinantal Point Processes (DPP). Our model aims to provide diverse features which can be composed in either a supervised or unsupervised framework. The framework aims to pro…
Paper presents a method for probabilistic load forecasting using adaptive online learning.
problem Inability to assess intrinsic uncertainties and capture dynamic changes in consumption patterns.
method Adaptive online learning of hidden Markov models for recursive parameter updates and sequential prediction.
result Significant improvement in performance compared to existing techniques across various scenarios.
Unified Bayesian framework for efficient off-policy evaluation and learning in large action spaces.
problem Efficient off-policy evaluation and learning in systems with correlated actions.
method Unified Bayesian framework with structured priors and sDM approach.
result sDM leverages action correlations without compromising computational efficiency.
Study assesses whether RL algorithm personalizes treatment sequences.
problem Evaluate if RL algorithm truly personalizes treatment sequences.
method Resampling-based methodology to investigate personalization.
result RL algorithm's personalization may be due to stochasticity.
Automated model assesses online health info quality using machine learning.
problem Low quality health information on the internet poses risks to patients.
method Used machine learning models, specifically hierarchical encoder attention-based neural networks (HEA) with BERT and BioBERT embeddings.
result HEA models outperform traditional models in evaluating health info quality.
Distributed computing offers a high degree of flexibility to accommodate modern learning constraints and the ever increasing size of datasets involved in massive data issues. Drawing inspiration from the theory of distributed computation models developed in the context of gradient-type optimization algorithms, we prese…
This study simulates biases in classifiers to assess fairness.
problem Mitigating biases in predictive models to ensure fairness.
method Agent-based model (ABM) to generate synthetic datasets with controlled biases, applied to offline and online learning approaches.
result Demonstrates how biases in data affect classifier outcomes and how mitigations impact feature usage.
COLoKe adapts Koopman embeddings online, reducing overfitting and improving long-term predictions.
problem Online adaptation of Koopman embeddings to avoid overfitting and maintain long-term predictive accuracy.
method Combines deep feature learning with multistep prediction consistency in a lifted space, using a conformal-style mechanism for selective updates.
result Empirically effective in reducing overfitting and maintaining long-term predictive accuracy.
Although compelling assessments have been examined in recent years, more studies are required to yield a better understanding of the several methods where assessment techniques significantly affect student learning process. Most of the educational research in this area does not consider demographics data, differing met…
Study online conformal prediction for non-stationary data with optimal training-conditional regret.
problem Online prediction for non-stationary data streams with unknown distribution drift.
method Proposes split-conformal and full-conformal algorithms that adapt to drift detection and incorporate stability for online learning.
result Proves minimax-optimal regret for online full conformal algorithm under appropriate restrictions.
Deep RL for portfolio management shows poor robustness.
problem Robustness of Deep RL algorithms in online portfolio management.
method Proposed a training and evaluation process for assessing DRL algorithms.
result Most Deep RL algorithms are not robust, generalizing poorly and degrading quickly.
Paper tackles continual reinforcement learning by forgetting, proposing a planning method with online world models.
problem Catastrophic forgetting in reinforcement learning when learning new tasks.
method Planning with an online world model using model predictive control.
result The proposed FTL Online Agent (OA) learns new tasks without forgetting old skills.
The true online TD(λ) algorithm has recently been proposed (van Seijen and Sutton, 2014) as a universal replacement for the popular TD(λ) algorithm, in temporal-difference learning and reinforcement learning. True online TD(λ) has better theoretical properties than conventional TD(λ), and the expectation is that it als…
Paper tackles policy selection with logged data and limited online interactions.
problem Safe evaluation and deployment of offline reinforcement learning policies.
method Active offline policy selection combining logged data with online interaction.
result Improves upon state-of-the-art OPE estimates and pure online policy evaluation.
Automates quality control for synthetic CTs generated from MR images.
problem Prevent downstream errors in RT treatment planning from synthetic CTs.
method Ensemble of sCT generators and uncertainty measure based on their disagreement.
result Uncertainty measure can detect input images outside expected MR distribution and sCT images with potential errors.
Online surveillance detects systemic risk in financial markets.
problem Detecting and monitoring systemic risk in financial markets.
method Online monitoring procedures for multiple series, controlling for false rejections.
result Procedures allow timely detection of financial distress.
The paper explores how to measure and optimize ad reach while maintaining user privacy.
problem Measuring ad reach while preserving user privacy in online advertising.
method Introduces k k k -anonymity and probabilistic discounting for frequency capping. result Privacy introduces a significant performance drop but with manageable costs.
New β 3 β^3 β 3 -IRT model improves test performance and assesses classifier quality.
problem Improving test performance and assessing classifier quality.
method Proposes β 3 β^3 β 3 -IRT model to model continuous responses and assess latent abilities. result The β 3 β^3 β 3 -IRT model outperforms standard models on various datasets and provides a new metric for classifier evaluation. Study evaluates AD methods for fraud detection in online credit card payments.
problem Fraud detection in online credit card payments using anomaly detection methods.
method Assessed several recent anomaly detection methods and compared them with standard supervised learning methods.
result LightGBM outperforms other methods but is more sensitive to distribution shifts.
Optimal online data collection for semiparametric inference reduces regret.
problem Sequential data collection decisions for efficient estimation under budget constraints.
method Online Moment Selection framework; Explore-then-Commit and Explore-then-Greedy policies.
result Online data collection policies achieve zero regret relative to an oracle policy.
Existing approaches to online convex optimization (OCO) make sequential one-slot-ahead decisions, which lead to (possibly adversarial) losses that drive subsequent decision iterates. Their performance is evaluated by the so-called regret that measures the difference of losses between the online solution and the best ye…
Bayesian reflex models AI learning like the autonomic nervous system.
problem Online learning in dynamic AI environments.
method Bayesian online algorithms with belief maintenance, sequential updating, and uncertainty-driven action balancing.
result Unified framework for adaptive AI learning.
This paper explores online learning of dynamics and state using ensemble Kalman filters.
problem Reconstructing dynamics from partial and noisy observations in real-time.
method Ensemble Kalman filter (EnKF) family of algorithms for online learning of dynamics and state.
result Demonstrates the efficiency and accuracy of online learning methods using Lorenz models.
Improved online classification for manual material handling using wearable sensors.
problem Online monitoring of manual material handling activities using wearable sensors.
method Optimizes dictionary learning to improve sparse representation classification (SRC) accuracy and computational efficiency.
result Proposed method outperforms benchmark methods in accuracy and computational time for online monitoring.
Strategic feature manipulation helps learners identify meaningful variables in online regression settings.
problem Strategic feature manipulation poses a challenge for learners in online regression settings.
method Investigates how strategic feature manipulation by individuals can help learners recover meaningful features.
result Simple learner behavior can help accurately recover meaningful features and incentivize feature improvement.
The study simplifies assessing overlap in logistic regression models using empirical likelihood.
problem Assessing overlap in multidimensional logistic regression models.
method Translation of Silvapulle's condition to empirical likelihood maximization, mechanized with R code.
result Minimal overlapping structures are cataloged in dimensions less than four, providing rules for higher dimensions.
Optimal sampling reduces power grid data analysis costs.
problem Efficient online analysis of high-speed, correlated IoT data.
method D-optimality criterion-based sampling methods combining Bernoulli and leverage score sampling.
result Leverage score sampling improves computational efficiency and outperforms benchmarks.
We propose an computational framework for real-time risk assessment and prioritizing for random outcomes without prior information on probability distributions. The basic model is built based on satisficing measure (SM) which yields a single index for risk comparison. Since SM is a dual representation for a family of r…
We present in this paper an empirical framework motivated by the practitioner point of view on stability. The goal is to both assess clustering validity and yield market insights by providing through the data perturbations we propose a multi-view of the assets' clustering behaviour. The perturbation framework is illust…
We propose an offline-online procedure for Fourier transform based option pricing. The method supports the acceleration of such essential tasks of mathematical finance as model calibration, real-time pricing, and, more generally, risk assessment and parameter risk estimation. We adapt the empirical magic point interpol…
Adaptive algorithm for online evaluation of targeted audiences in advertising.
problem Determining the right match between advertising creatives and target audiences.
method Contextual bandit approach to address audience overlap and learn optimal display policies.
result The proposed method is more efficient than traditional split-testing methods.
Enhances load forecasting for multiple entities with dynamic similarities.
problem Inaccurate probabilistic load predictions due to uncertainties and dynamic changes.
method Online multi-task learning for probabilistic load forecasting.
result Significantly enhances load forecasting accuracy across various scenarios.
Paper proposes efficient online estimation of causal effects by deciding which data sources to query.
problem Data fusion problems with multiple data sources capturing distinct subsets of variables.
method Online moment selection (OMS) framework, balancing exploration and exploitation.
result OMS algorithms achieve zero asymptotic regret for estimating average treatment effects.
This study uses OPE methods to quickly assess auction policies.
problem Rapid decision-making in dynamic auction environments.
method Off-Policy Evaluation and counterfactual methods.
result Improved policy selection and optimization.
Proposes auditing for envy-freeness in recommender systems to assess individual preferences.
problem Auditing fairness in recommender systems for individual preferences.
method Formulates a pure exploration problem in multi-armed bandits, proposing a sample-efficient algorithm with theoretical guarantees.
result Algorithm ensures fairness without deteriorating user experience on real-world datasets.
A new sequential method estimates Poisson means in streaming data, achieving optimality and efficiency.
problem Estimating Poisson means in a streaming, or online, framework.
method A quasi-Bayesian approach based on Newton's algorithm for a sequential estimate.
result Established frequentist guarantees including consistency and asymptotic optimality.
Proposes a compensation mechanism for improving individual forecast confidence.
problem Difficult to assess the quality of individual probabilistic forecasts and their utilities.
method Compensation mechanism based on fair bets and online learning.
result The proposed mechanism cannot be exploited and ensures forecasted utility matches actual utility.
Distributed algorithms for online linear regression in networked settings.
problem Online linear regression in a distributed network with various feedback types and adversary strategies.
method Simple gradient descent and averaging steps at each node, with regret bounds established.
result Regret bounds of O ( T 3 / 4 ) {\cal O}(T^{3/4}) O ( T 3/4 ) for unbounded decision sets and O ( T ) {\cal O}(\sqrt{T}) O ( T ) for bounded decision sets. New metric MADD assesses fairness of predictive student models.
problem Predictive student models can be biased and unfair, leading to discrimination.
method Proposes MADD metric to analyze model's discriminatory behaviors.
result Fair predictive performance does not guarantee fair behaviors or outcomes.
Online learning improves traffic congestion prediction over time.
problem Model degradation due to concept drift in traffic data.
method Incremental learning from non-stationary time series data.
result Performance of models degrades with increased prediction horizon.