SOTAVerified

Open-Ended Question Answering

Open-ended questions are defined as those that simply pose the question, without imposing any constraints on the format of the response. This distinguishes them from questions with a predetermined answer format.

Papers

Recently AddedMost HypedMost ActiveNeeds VerificationMost Verified

Showing 301–325 of 796 papers

TitleStatusHype
Width is Less Important than Depth in ReLU Neural Networks—0
Near-Optimal Learning of Extensive-Form Games with Imperfect Information—0
Weisfeiler and Leman Go Infinite: Spectral and Combinatorial Pre-ColoringsCode0
On the Convergence of Heterogeneous Federated Learning with Arbitrary Adaptive Online Model Pruning—0
Evaluating Machine Common Sense via Cloze Testing—0
Evidentiality-guided Generation for Knowledge-Intensive NLP Tasks—0
Testing the Ability of Language Models to Interpret Figurative Language—0
FogAdapt: Self-Supervised Domain Adaptation for Semantic Segmentation of Foggy Images—0
PWM2Vec: An Efficient Embedding Approach for Viral Host Specification from Coronavirus Spike SequencesCode0
Universal Online Learning with Bounded Loss: Reduction to Binary Classification—0
Exploring the Impact of Virtualization on the Usability of the Deep Learning Applications—0
Explanation as Question Answering based on Design Knowledge—0
Does Pre-training Induce Systematic Inference? How Masked Language Models Acquire Commonsense Knowledge—0
A Dynamical Model for the Origin of Anisogamy—0
Finding Structure in Silence: The Role of Pauses in Aligning Speaker Expectations—0
Multi-Armed Bandits with Bounded Arm-Memory: Near-Optimal Guarantees for Best-Arm Identification and Regret Minimization—0
Simple Stochastic and Online Gradient Descent Algorithms for Pairwise Learning—0
On the Practical Consistency of Meta-Reinforcement Learning Algorithms—0
On the Value of Infinite Gradients in Variational Autoencoder Models—0
Think Big, Teach Small: Do Language Models Distil Occam’s Razor?Code0
Computational Complexity of Normalizing Constants for the Product of Determinantal Point Processes—0
Simple Stochastic and Online Gradient DescentAlgorithms for Pairwise LearningCode0
Dynamic Regret for Strongly Adaptive Methods and Optimality of Online KRR—0
Uncertainty Quantification of Surrogate Explanations: an Ordinal Consensus Approach—0
Understanding Multimodal Procedural Knowledge by Sequencing Multimodal Instructional Manuals—0
Show:102550
← PrevPage 13 of 32Next →

No leaderboard results yet.