Paper proposes a new speech representation benchmark and model.
problem Lack of benchmarks for comparing speech representations.
method Unsupervised triplet-loss objective for training a universal non-semantic speech representation.
result Proposed representation outperforms other models on benchmark and transfer learning tasks.
A new benchmark task for evaluating policy learning in complex, high-dimensional action spaces.
problem Lack of a commonly accepted benchmark for evaluating policy learning in hierarchical tasks with high-dimensional action spaces.
method Proposed DinerDash Gym benchmark and Decomposed Policy Graph Modelling (DPGM) algorithm.
result DPGM achieves significant improvement over baselines and effectively injects domain knowledge.
GraphBench creates a unified benchmark for graph learning tasks.
problem Fragmented benchmarking practices and inconsistent evaluation protocols in graph learning.
method Developed a comprehensive benchmark suite with standardized evaluation protocols.
result Established principled baselines for future research in graph learning.
UCFE benchmarks LLMs in financial tasks with human feedback.
problem Evaluating LLMs' financial task performance and user satisfaction.
method Hybrid approach combining human expert evaluations and dynamic interactions.
result Significant alignment between benchmark scores and human preferences (Pearson correlation coefficient of 0.78).
Study constructs a Japanese financial LLM benchmark.
problem Need for domain-specific benchmarks for LLMs.
method Constructed a benchmark with multiple Japanese and financial domain tasks.
result GPT-4 outperforms other models in the benchmark.
RETINA Benchmark evaluates Bayesian deep learning on diabetic retinopathy detection.
problem Reliable uncertainty quantification for deep learning models in medical applications.
method Design and evaluation of a real-world diabetic retinopathy dataset and tasks.
result Benchmarking of Bayesian deep learning methods on diabetic retinopathy detection tasks.
We created financial benchmarks for distribution shifts in crude oil prices and volatility.
problem Scarcity of task-labeled time-series benchmarks in finance.
method Transformed asset price data into volatility proxies, generated task labels based on distribution shifts, and made datasets publicly available.
result Inclusion of task labels improves continual learning algorithms' performance on real-world data.
ZeroSCROLLS benchmarks zero-shot natural language understanding over long texts.
problem Evaluate natural language understanding models over long texts without training data.
method Adapt six tasks from SCROLLS benchmark and add four new datasets, including novel aggregation tasks.
result Claude outperforms ChatGPT, and GPT-4 achieves highest average score.
InvestorBench benchmarks LLM agents in financial tasks.
problem Lack of a comprehensive benchmark for LLM-based financial agents.
method Developed a benchmark with diverse financial tasks and datasets.
result Evaluated LLM agents' performance across various financial products and market environments.
WOODS benchmarks improve understanding of time series OOD generalization.
problem Limited understanding of OOD generalization in time series.
method Presented eight open-source time series benchmarks and revised OOD algorithms.
result Large room for improvement in OOD generalization algorithms for time series.
FinMaster benchmarks LLMs in financial tasks, revealing gaps in reasoning.
problem Challenges in financial tasks, including labor-intensive processes and low error tolerance.
method Developed a comprehensive financial benchmark (FinMaster) with three modules: FinSim, FinSuite, and FinEval.
result LLMs struggle with complex financial reasoning, showing significant accuracy drops.
This paper investigates task-level evaluation in few-shot learning models.
problem The reliability of evaluating and tuning models trained for individual tasks in few-shot learning is not well addressed.
method The paper measures accuracy of performance estimators, considers model selection strategies, and examines the reasons for evaluator failure.
result Cross-validation with a low number of folds is best for estimating model performance, while large number of folds is better for model selection.
Study finds little progress in medical machine learning benchmarks over 3 years.
problem Lack of meaningful progress in medical machine learning benchmarks for structured healthcare data.
method Comprehensive review and meta-analysis of benchmarks in medical machine learning for structured data.
result Deep recurrent models perform only better than logistic regression on certain clinical prediction tasks.
FinSurvival provides a large-scale financial survival modeling benchmark.
problem Lack of large-scale, realistic, and freely available datasets for benchmarking AI survival models.
method Derived 16 survival modeling tasks from cryptocurrency lending data using an automated pipeline.
result Demonstrated that existing AI survival models are not well-suited for these challenging tasks.
Paper defines benchmarks for learning new tasks sequentially.
problem Efficient evaluation of continual few-shot learning.
method Theoretical framework and flexible benchmarks.
result Introduction of SlimageNet64 for efficient evaluation.
EDINET-Bench evaluates LLMs on complex financial tasks using Japanese financial statements.
problem Challenges in evaluating LLMs on financial tasks due to specialized expertise and scarce benchmarks.
method Developed EDINET-Bench, an open-source Japanese financial benchmark for LLMs on tasks like fraud detection and earnings forecasting.
result State-of-the-art LLMs perform only marginally better than logistic regression in financial tasks, highlighting the need for more realistic benchmarks.
Proposes a method to evaluate meta-learning performance based on task similarity.
problem Meta-learning performance evaluation ignores task similarity, leading to biased results.
method Generative approach using Latent Dirichlet Allocation to analyze task similarity.
result The proposed method provides an insightful evaluation of meta-learning algorithms, matching common intuition.
Randomly guessing weights helps analyze RL benchmarks objectively.
problem Understanding the complexity of reinforcement learning benchmarks.
method Generate policy networks by randomly guessing their parameters, evaluate on benchmarks, and analyze results.
result Small untrained networks can provide a robust baseline for various RL tasks.
Introduces AMLB, an open benchmark for AutoML frameworks.
problem Challenges in comparing AutoML frameworks.
method Open benchmark with 9 AutoML frameworks, 71 classification, 33 regression tasks, multi-faceted analysis, Bradley-Terry trees.
result Differences in AutoML frameworks' performance and trade-offs.
The paper quantifies uncertainty in aggregated machine learning metrics.
problem Uncertainty in summarizing model performance across multiple tasks.
method Statistical methodologies including bootstrapping and Bayesian modeling.
result Insights into model performance dominance for specific tasks.
Learning new tasks with few samples using related task evaluations.
problem Learning a new task with limited data and related task evaluations.
method Modeling task relatedness through weak monotonicity and leveraging it in transfer learning and model selection aggregation.
result Pruning the model class based on monotonicity and hedging on the task frontier.
Study logical generalization in GNNs using a new benchmark.
problem Understanding how GNNs adapt to new logical tasks.
method Developed GraphLog benchmark suite for logical tasks, evaluated GNNs in supervised, pretraining, and continual learning settings.
result Logical diversity during training affects GNNs' ability to generalize.
New benchmark PVR tests neural network reasoning about indirection.
problem Understanding neural network generalization limits.
method Introducing Pointer Value Retrieval (PVR) benchmark.
result Large variations in performance across different conditions.
CausalWorld benchmarks robotic manipulation tasks with causal structure for transfer learning.
problem Challenges in transferring learned skills to new robotic manipulation environments.
method Proposes a simulation-based benchmark with a combinatorial family of tasks.
result Demonstrates the feasibility of tasks in the benchmark and provides baseline results.
This article provides a comprehensive study of different ways to make speed benchmarks of gradient boosted decision trees algorithm. We show main problems of several straight forward ways to make benchmarks, explain, why a speed benchmarking is a challenging task and provide a set of reasonable requirements for a bench…
This paper benchmarks uncertainty disentanglement across various tasks.
problem Disentangling multiple sources of uncertainty for specialized tasks.
method Reimplemented and evaluated a wide range of uncertainty estimators.
result No existing approach provides disentangled uncertainty estimators in practice.
GNNs improve supply chain analytics with real-world benchmarks.
problem Limited research on applying GNNs to supply chain management.
method Conceptual discussions, detailed formulations, examples, mathematical definitions, and task guidelines.
result GNN-based models outperform other methods by 10-40% in various supply chain tasks.
This work benchmarks MARL algorithms in cooperative tasks.
problem Lack of evaluation tasks and criteria for comparing MARL algorithms.
method Systematic evaluation of three MARL algorithm classes in diverse cooperative tasks.
result Insights into the effectiveness of different learning approaches.
The past few years have seen a surge of applying Deep Learning (DL) models for a wide array of tasks such as image classification, object detection, machine translation, etc. While DL models provide an opportunity to solve otherwise intractable tasks, their adoption relies on them being optimized to meet latency and re…
QUACKIE creates a new benchmark for NLP interpretability.
problem Evaluating NLP interpretability methods is challenging due to biased ground truths.
method Formulated a custom classification task from question-answering datasets, generating unbiased ground truths.
result Demonstrated the effectiveness of current interpretability methods on the new benchmark.
Benchmark for DL inference on embedded HWAs, focusing on autonomous driving.
problem Lack of comprehensive benchmarks for DL hardware.
method Developed a benchmark for inference on embedded HWAs, focusing on autonomous driving. Proposed new granularity, benchmark procedures, and performance indicators.
result Identifies mismatches between HWAs and DL models.
HEAR benchmark evaluates audio representations for diverse tasks.
problem Developing a general-purpose audio representation for various tasks.
method Evaluated 29 models across 19 tasks using 16 datasets.
result No single audio representation performs holistically.
Hybrid quantum-classical RL model solves standard benchmark tasks and proves quantum advantage.
problem Challenges in reinforcement learning, especially in solving standard benchmarking tasks.
method Parametrized quantum circuits in a hybrid quantum-classical RL model.
result Demonstrates quantum advantage in solving standard benchmarking tasks and intractable classical problems.
Meta Omnium benchmarks few-shot learning across diverse vision tasks.
problem Evaluating generalization of few-shot learning across multiple vision tasks.
method Introduction of Meta Omnium dataset and evaluation of meta-learning algorithms.
result Meta-learning algorithms can generalize across diverse vision tasks.
Benchmark for math reasoning models from human proofs.
problem Measuring and accelerating machine learning models in high-level mathematical reasoning.
method Built a non-synthetic dataset from theorem prover proofs, defined a task for model to fill in missing propositions, used hierarchical transformer to improve performance.
result Neural models can capture non-trivial mathematical reasoning, hierarchical transformer outperforms baseline.
Through many recent successes in simulation, model-free reinforcement learning has emerged as a promising approach to solving continuous control robotic tasks. The research community is now able to reproduce, analyze and build quickly on these results due to open source implementations of learning algorithms and simula…
Multi-task learning shares information between related tasks, sometimes reducing the number of parameters required. State-of-the-art results across multiple natural language understanding tasks in the GLUE benchmark have previously used transfer from a single large task: unsupervised pre-training with BERT, where a sep…
Forward-prediction models enhance physical reasoning, but only for specific tasks.
problem Improving physical reasoning in complex tasks involving many objects.
method Incorporated forward-prediction models into simple physical-reasoning agents and evaluated their performance on the PHYRE benchmark.
result Forward-prediction models improve physical-reasoning performance, especially on complex tasks, but generalization to new task templates is challenging.
BAT benchmark for autobidding tasks in RTB auctions.
problem Lack of comprehensive datasets and benchmarks for autobidding.
method Developed a benchmark for two auction formats, implemented robust baselines.
result Provides a framework for developing and refining autobidding algorithms.
ROBEL is an open-source platform of cost-effective robots designed for reinforcement learning in the real world. ROBEL introduces two robots, each aimed to accelerate reinforcement learning research in different task domains: D'Claw is a three-fingered hand robot that facilitates learning dexterous manipulation tasks, …
AI benchmarks evaluate football team performance using generative models.
problem Evaluating human performance in complex interactive tasks is error-prone and unreliable.
method Trained Conditional VRNN Model on player and ball tracking data to imitate and predict team interactions.
result Trained model as a useful benchmark for evaluating team performance in football.
Paper introduces a benchmark for predicting bankruptcy from text data.
problem Lack of a common benchmark dataset and evaluation strategy for unstructured data in bankruptcy prediction.
method Describes and evaluates several baseline models, including a bag-of-words model.
result A lightweight bag-of-words model performs surprisingly well, especially when considering data from multiple years.
SCROLLS benchmarks long text NLP tasks, improving existing models.
problem Short NLP benchmarks ignore long texts; SCROLLS addresses this.
method Handpicked long-text datasets for summarization, QA, and inference tasks.
result Improvement potential on SCROLLS tasks, as indicated by initial baselines.
Study benchmarks LLMs in portfolio optimization tasks.
problem Evaluate financial decision-making of LLMs.
method Mathematically explicit portfolio optimization problems with multiple-choice questions.
result Distinct performance patterns among LLMs in different financial tasks.
This paper benchmarks algorithms for training fair DNNs, addressing real-world fairness constraints.
problem Training deep neural networks with fairness constraints.
method Benchmarking stochastic approximation algorithms for fairness-constrained DNN training.
result Demonstrates the use of a new benchmark for comparing fairness-improving algorithms.
Meta-reinforcement learning algorithms can enable robots to acquire new skills much more quickly, by leveraging prior experience to learn how to learn. However, much of the current research on meta-reinforcement learning focuses on task distributions that are very narrow. For example, a commonly used meta-reinforcement…
New benchmarks for offline RL from diverse datasets.
problem Measuring progress in offline RL due to lack of suitable benchmarks.
method Developed benchmarks tailored for offline RL, focusing on diverse dataset properties.
result Revealed deficiencies in existing offline RL algorithms.
NAS-Bench-Suite simplifies NAS evaluation across diverse tasks.
problem Limited and inconsistent NAS benchmarks hinder research reproducibility.
method Developed a comprehensive, extensible NAS benchmark suite.
result Many NAS conclusions do not generalize across different benchmarks.