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 201–250 of 796 papers

TitleStatusHype
Algorithms and SQ Lower Bounds for PAC Learning One-Hidden-Layer ReLU Networks—0
Acquiring Annotated Data with Cross-lingual Explicitation for Implicit Discourse Relation Classification—0
Distribution-Independent PAC Learning of Halfspaces with Massart Noise—0
DNF-Net: A Neural Architecture for Tabular Data—0
Increasing Depth Leads to U-Shaped Test Risk in Over-parameterized Convolutional Networks—0
Debunking Sentiment Lexicons: A Case of Domain-Specific Sentiment Classification for Croatian—0
A general approximation lower bound in L^p norm, with applications to feed-forward neural networks—0
Domain Adaptive Image-to-Image Translation—0
Automatic Tuning of Stochastic Gradient Descent with Bayesian Optimisation—0
Do pretrained transformers infer telicity like humans?—0
2CP: Decentralized Protocols to Transparently Evaluate Contributivity in Blockchain Federated Learning Environments—0
Autonomous Open-Ended Learning of Interdependent Tasks—0
Doubly Adversarial Federated Bandits—0
Drift anticipation with forgetting to improve evolving fuzzy system—0
Most Important Person-guided Dual-branch Cross-Patch Attention for Group Affect Recognition—0
Duff: A Dataset-Distance-Based Utility Function Family for the Exponential Mechanism—0
Dynamic Algorithms for Matroid Submodular Maximization—0
Dynamic Network Model from Partial Observations—0
Fast and Efficient Asynchronous Neural Computation with Adapting Spiking Neural Networks—0
Effective Parallelisation for Machine Learning—0
Efficient Bi-level Optimization for Non-smooth Optimization—0
Efficient human-like semantic representations via the Information Bottleneck principle—0
A Reparameterization-Invariant Flatness Measure for Deep Neural Networks—0
Most Equitable Voting Rules—0
DashNet: A Hybrid Artificial and Spiking Neural Network for High-speed Object Tracking—0
Embedding-based Product Retrieval in Taobao Search—0
Bandit Convex Optimization: Towards Tight Bounds—0
End-to-End Pore Extraction and Matching in Latent Fingerprints: Going Beyond Minutiae—0
Enhancing Gradient-based Attacks with Symbolic Intervals—0
Enhancing Large Language Models with Pseudo- and Multisource- Knowledge Graphs for Open-ended Question Answering—0
Ensemble-Based Deep Reinforcement Learning for Chatbots—0
Episodic memory governs choices: An RNN-based reinforcement learning model for decision-making task—0
Equivalence of Multicategory SVM and Simplex Cone SVM: Fast Computations and Statistical Theory—0
Exploiting the Sensitivity of L_2 Adversarial Examples to Erase-and-Restore—0
Escaping Saddle Points Faster with Stochastic Momentum—0
Ethical Artificial Intelligence - An Open Question—0
Better state exploration using action sequence equivalence—0
Evaluating Machine Common Sense via Cloze Testing—0
A Comparison of Explicit and Implicit Proactive Dialogue Strategies for Conversational Recommendation—0
Fair assignment of indivisible objects under ordinal preferences—0
Fast Binary Functional Search on Graph—0
Evaluation of Spectral Learning for the Identification of Hidden Markov Models—0
Cross-view Brain Decoding—0
Cross-modal Face- and Voice-style Transfer—0
Evidentiality-guided Generation for Knowledge-Intensive NLP Tasks—0
Evolutionary dynamics of incubation periods—0
A Re-Examination of the Evidence used by Hooge et al (2018) "Is human classification by experienced untrained observers a gold standard in fixation detection?"—0
Cross-Lingual QA as a Stepping Stone for Monolingual Open QA in Icelandic—0
Exit options sustain altruistic punishment and decrease the second-order free-riders, but it is not a panacea—0
A Quantitative Review on Language Model Efficiency Research—0
Show:102550
← PrevPage 5 of 16Next →

No leaderboard results yet.