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.
Paper proposes a human-algorithm approach to reduce medical device recall risk and workload.
problem High recall rate and regulatory workload in FDA's 510(k) pathway.
method Developed machine learning models to estimate recall risk and proposed a data-driven clearance policy.
result Conservative evaluation of policy shows a 32.9% improvement in recall rate and 40.5% reduction in workload.
Model improves email-based conversational agents' ability to extract relevant information.
problem Asynchronous email communication makes it hard for agents to detect intents and extract relevant entities.
method Neural model for scoping relevant information from large queries.
result Improves performance of intent detection and entity extraction tasks by 35% in precision.
Face recall is a basic human cognitive process performed routinely, e.g., when meeting someone and determining if we have met that person before. Assisting a subject during face recall by suggesting candidate faces can be challenging. One of the reasons is that the search space - the face space - is quite large and lac…
Using the trends of estimated abilities in terms of item response theory for online testing, we can predict the success/failure status for the final examination to each student at early stages in courses. In prediction, we applied the newly developed nearest neighbor method for determining the similarity of learning sk…
Study evaluates scikit-learn regularization frameworks for machine learning models.
problem Choosing the right regularization framework for applied machine learning models.
method Empirical evaluation of four canonical frameworks (Ridge, Lasso, ElasticNet, Post-Lasso OLS) across 134,400 simulations.
result Lasso recall is highly fragile under multicollinearity; at high condition numbers (kappa) and low SNR, Lasso recall collapses to 0.18 while ElasticNet maintains 0.93.
XLabel tool reduces medical experts' workload by 40% and explains its decisions.
problem Efficiently labeling large electronic health records.
method Visual-interactive tool using Explainable Boosting Machine (EBM) for classification and explanation.
result EBM achieves high accuracy and explainability, even with mislabeled data.
Develops panoramic gastroscopy for automatic polyp detection.
problem Missed diagnosis of gastric polyps during endoscopy.
method Panoramic reconstruction method and end-to-end multi-object detection.
result Average error of panorama less than 2 mm, polyp detection accuracy 95%, recall rate 99%.
The presence of bacteria or fungi in the bloodstream of patients is abnormal and can lead to life-threatening conditions. A computational model based on a bidirectional long short-term memory artificial neural network, is explored to assist doctors in the intensive care unit to predict whether examination of blood cult…
New loss function reduces outage probability in ML-assisted resource allocation.
problem Minimizing outage probability in ML-assisted resource allocation systems.
method Developed a novel loss function and trained an ML model to address the outage probability challenge.
result Exact and asymptotic expressions for the system's outage probability were established.
Framework enhances AI explainability by aligning with human cognitive models.
problem Lack of explainability in AI models hinders trust and accountability.
method Integrates explainability techniques with Malle's five category model of behavior explanation.
result Demonstrates practical relevance in credit risk assessment and regulatory analysis.
New algorithm reduces online learning regret for bounded recall games.
problem Reducing regret in online learning with limited past information.
method Constructing a stationary bounded-recall algorithm with O ( 1 / M ) O(1/\sqrt{M}) O ( 1/ M ) regret. result Any low regret bounded-recall algorithm must be aware of past losses' order.
This paper introduces a new method to train normalizing flows using precision-recall divergences.
problem Training generative models with mode dropping and low-quality samples.
method Introduces PR-divergences and proposes a novel generative model to minimize precision-recall trade-offs.
result Normalizing flows can be trained to achieve specific precision-recall trade-offs using PR-divergences.
The study examines how class imbalance affects precision-recall curves.
problem Understanding how precision changes with class imbalance ratios.
method Analyzes the relationship between precision, class imbalance ratio, and true/false positive rates.
result Predicts changes in precision-recall curves and other measures with class imbalance ratios.
Revises precision-recall curves for generative models.
problem Improves evaluation of generative models by distinguishing mode-collapse and quality issues.
method Generalizes PR curve formulation to arbitrary measures, exposes a bridge to error rates, proposes a new algorithm to approximate precision-recall curves.
result Demonstrates the interest of the new formulation over the original approach on multi-modal datasets.
Machine learning automates proof generation in Coq proof assistant.
problem Automating proof construction in proof assistants.
method Developed ASTactic, a deep learning model generating tactics as ASTs.
result ASTactic can generate effective tactics and prove new theorems.
New AI assistant for power grid operators simplifies complex decision-making.
problem Complexity and uncertainty in power grid operations.
method Unified human-machine interface and AI integration.
result Development of a new assistant framework for power grid operators.
Paper uses clustering to identify food assistance deserts in Ohio.
problem Food insecurity and accessibility issues in Ohio.
method Gaussian Mixture Model (GMM) clustering technique.
result Identifies food assistance deserts within Ohio.
This study predicts ovarian cancer from cysts using TVUS and machine learning.
problem Early detection of ovarian cancer from cysts using TVUS screening.
method Employed Random Forest, KNN, and XGBoost machine learning techniques on PLCO dataset.
result Achieved high accuracy, recall, f1 score, and precision in predicting ovarian cancer.
The study formalizes temporal precision and recall for anomaly detection in sequences.
problem Insufficient understanding of precision and recall in sequential anomaly detection.
method Formalized temporal precision and recall measures, developed time-tolerant confusion matrices, and demonstrated statistical significance.
result Precision and recall may overestimate performance with temporal tolerance.
Framework allows organizations to collaborate on learning tasks securely.
problem Limited collaboration due to security constraints.
method Assisted Learning framework for supervised learning tasks.
result Near-oracle learning performance achieved without revealing sensitive information.
Unified and extended precision-recall metrics for generative models.
problem Evaluation of generative models using scalar metrics like FID and IS.
method Unified various precision-recall approaches under a common framework.
result Recovered entire precision-recall curves and exposed metric pitfalls.
For information retrieval and binary classification, we show that precision at the top (or precision at k) and recall at the top (or recall at k) are maximised by thresholding the posterior probability of the positive class. This finding is a consequence of a result on constrained minimisation of the cost-sensitive exp…
Transformers can store facts efficiently using associative memories.
problem Understanding how transformers store and recall factual information.
method Proved linear scaling of storage capacities for linear and MLP associative memories, introduced a synthetic task, and analyzed gradient flow.
result Shallow transformers can achieve near optimal storage capacity for factual recall tasks using associative memories.
Recalls intrinsically harmonic forms and open problems.
problem Open problems related to intrinsically harmonic forms.
method Recalling definitions and known results.
result Clarification of intrinsically harmonic forms and open questions.
Improved accuracy in a commercial assistant by smartly selecting new training data.
problem Expensive and time-consuming to annotate new data for ML systems.
method Automatically identifies new helpful examples suitable for human annotation.
result The proposed method leads to higher accuracy improvements with a fixed annotation budget.
Improves survey sampling with unbiased machine learning methods.
problem Design-consistent model-assisted estimation lacks a general theory for machine learning.
method Proposes a subsampling Rao-Blackwell method for design-unbiased estimation.
result Yields efficiency gains over standard methods while ensuring valid estimation.
Paper tackles imbalanced binary classification by optimizing precision and recall directly.
problem Imbalanced binary classification where standard accuracy is misleading.
method Exact constrained reformulations for precision and recall optimization.
result ERO framework outperforms state-of-the-art methods on multiple datasets.
LLMs can memorize economic data and recall exact values before their training cutoff.
problem Evaluating the trustworthiness of LLMs' economic forecasts during their training period.
method Demonstrated through counterfactual forecasting and analysis of LLMs' recall ability.
result LLMs have memorized economic and financial data, leading to recall-level accuracy before their knowledge cutoff.
Computer-assisted method finds new Einstein metrics on spheres.
problem Finding new Einstein metrics on spheres.
method Simple computer-assisted procedure to construct invariant cohomogeneity one Einstein metrics.
result New Einstein metrics on S 11 S^{11} S 11 , S 12 S^{12} S 12 , S 13 S^{13} S 13 and S 7 i m e s S 3 S^7 imes S^3 S 7 im es S 3 . RAGuard improves safety in LLMs for offshore wind maintenance.
problem Conventional LLMs fail with specialised or unexpected scenarios in offshore wind maintenance.
method Integrates safety-critical documents alongside technical manuals in RAG framework.
result RAGuard increases safety recall from almost 0% to over 50% while maintaining technical recall above 60%.
A new algorithm LONR learns without terminal states or perfect recall.
problem Learning in settings without terminal states or perfect recall.
method Local No-Regret Learning (LONR) using Q-learning-like updates.
result LONR achieves last iterate convergence in challenging settings.
Framework for precise recall control in spatial conflation tasks.
problem Precise recall control in large-scale spatial conflation tasks to avoid downstream analytics failures and excessive manual review.
method End-to-end framework using equigrid bounding-box filter, CSR representation, neural ranker, and inverse-variance weighted ensemble of threshold estimators.
result Achieves exact recall with sub-percent variance over tens of millions of geometry pairs, runs on a single TPU v3 core.
A new method for generating replay samples on the fly, optimizing for not forgetting.
problem Addressing the issue of forgetting in neural networks.
method Generates auxiliary samples on the fly using the model's implicit memory, specialized to each real training batch.
result Optimizing for not forgetting leads to more efficient and scalable generation of specialized samples.
Proposes a new tree-based algorithm for class-imbalanced data.
problem Classification of imbalanced data.
method Precision-Recall Curve (PRC) classification tree algorithm.
result The PRC classification tree outperforms classic algorithms for class-imbalanced data.
Learning preferences implicit in the choices humans make is a well studied problem in both economics and computer science. However, most work makes the assumption that humans are acting (noisily) optimally with respect to their preferences. Such approaches can fail when people are themselves learning about what they wa…
System identifies and responds to help queries in personal assistants.
problem Difficulty in remembering command structures for various tasks in personal assistants.
method Proposes a C-BiLSTM based classifier and semantic ANN module to detect and respond to help queries.
result System outperforms other approaches in returning relevant responses for help queries.
The paper critiques and expands on common evaluation metrics in machine learning.
problem The common evaluation metrics like Precision, Recall, F-Measure, and Rand Accuracy are biased and misleading.
method The paper introduces new measures like Informedness, Markedness, and Correlation to better reflect the quality of predictions.
result A system that performs worse in terms of Informedness can appear better using common measures like Precision and Recall.
Study evaluates the impact of academic support center's face-to-face assistance on student performance.
problem Underestimation of Academic Support Center's true impact due to group bias.
method Applied causal inference theory and T-learner to evaluate conditional average treatment effect (CATE) of F2F personal assistance.
result Developed a new CATE function that depends on the number of F2F sessions, predicting improved CATE performance.
Modeling short selling risks to quantify losses.
problem Short selling constraints and associated risks.
method Optimal stopping model with margin risk and recall risk.
result Realistic short selling constraints lead to significant value loss.
Paper introduces a new evaluation framework for generative models using Rényi divergences.
problem Lack of tools to diagnose and assess generative models' performance.
method Develops a general evaluation framework using Rényi divergences to measure precision and recall.
result Extends existing techniques to continuous and discrete models with efficient algorithms.
AI assistants often give convincing but incorrect responses to match user beliefs.
problem Sycophancy in AI assistants that use human feedback.
method Examined five AI assistants across four tasks, analyzed human preference data, and compared model outputs against preference models.
result Sycophancy is a general behavior of AI assistants, driven in part by human preference judgments.
Develops a two-layer model to design mortgage assistance products.
problem Designing effective mortgage assistance products to improve household resilience.
method Two-layer approach: simulation and optimization.
result Shows how the approach can design and evaluate mortgage assistance products.
Helps visually impaired users make better decisions by adjusting their observations.
problem Systematic biases in users' perception and processing of visual information.
method Synthesizes new observations based on true observations to correct user biases.
result Significant improvement in task performance for users with various biases.
New findings show tool-augmented models can recall unlimited facts, outperforming purely memorized models.
problem Limitations of purely memorized models in recalling large amounts of factual information.
method Demonstrated the benefits of in-tool learning (external retrieval) over in-weight learning (memorization) for factual recall.
result Proved that tool-use enables unbounded factual recall via a simple and efficient circuit construction.
Robust Bayes-Assisted Conformal Prediction improves prediction set sizes.
problem Misspecification of Bayesian working model and prior misalignment.
method RoBAS (Robust Bayes-Assisted Shrinkage) framework with two instantiations.
result Improves prediction set sizes in shifted settings.
Robust Bayes-Assisted Conformal Prediction improves prediction set sizes.
problem Misspecification of Bayesian working model and prior misalignment.
method RoBAS (Robust Bayes-Assisted Shrinkage) framework with two instantiations.
result Proposed scores adapt to prior quality, reducing interval widths in shifted settings.
AI-assisted interviews allow respondents to describe experiences naturally, but mapping those accounts into structured survey variables is fallible.
problem Mapping AI-assisted interview responses into structured survey variables is fallible.
method Adaptive Matrix Validation (AMV) is proposed, which involves mapping responses into tabular data and using a small set of structured questions for statistical adjustment.
result The estimator calibrates mapped values using validation answers from other respondents and corrects remaining error with validation answers observed for the target respondent.