Papers with Code 아카이브
Open-Ended Question Answering
태스크의 하위 분류와 논문·코드·평가·기법·데이터셋을 탐색하세요.
- 하위 태스크
- 0
- 평가표
- 0
- 보존된 평가 기록
- 0
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.
논문
이 태스크와 하위 분야의 관련 논문입니다. 실제 성능 비교는 평가 결과에서 확인하세요.
Context-Aware Language Modeling for Goal-Oriented Dialogue Systems
Improving Passage Retrieval with Zero-Shot Question Generation
The comparative statics of persuasion
A Comparative Study of Pre-trained Encoders for Low-Resource Named Entity Recognition
Data-Centric Green AI: An Exploratory Empirical Study
Model Predictive Control for Fluid Human-to-Robot Handovers
Compositional optimization of quantum circuits for quantum kernels of support vector machines
Stability and Risk Bounds of Iterative Hard Thresholding
The Structured Abstain Problem and the Lovász Hinge
Occlusion Fields: An Implicit Representation for Non-Line-of-Sight Surface Reconstruction
X-Learner: Learning Cross Sources and Tasks for Universal Visual Representation
Bamboo: Building Mega-Scale Vision Dataset Continually with Human-Machine Synergy
Regret Bounds for Expected Improvement Algorithms in Gaussian Process Bandit Optimization
Few-Sample Traffic Prediction with Graph Networks using Locale as Relational Inductive Biases
HEAR: Holistic Evaluation of Audio Representations
A Characterization of Multiclass Learnability
Fault-Tolerant Neural Networks from Biological Error Correction Codes
M2I: From Factored Marginal Trajectory Prediction to Interactive Prediction
Parameterized Intractability for Multi-Winner Election under the Chamberlin-Courant Rule and the Monroe Rule
Overcoming a Theoretical Limitation of Self-Attention
Dissecting graph measure performance for node clustering in LFR parameter space
Partially Fake Audio Detection by Self-attention-based Fake Span Discovery
Maximizing Communication Efficiency for Large-scale Training via 0/1 Adam
On characterizations of learnability with computable learners
Complexity of Arithmetic in Warded Datalog+-
A hypothesis-driven method based on machine learning for neuroimaging data analysis
Width is Less Important than Depth in ReLU Neural Networks
Machine Explanations and Human Understanding
Near-Optimal Learning of Extensive-Form Games with Imperfect Information
Weisfeiler and Leman Go Infinite: Spectral and Combinatorial Pre-Colorings
PCL: Peer-Contrastive Learning with Diverse Augmentations for Unsupervised Sentence Embeddings
An Analysis on Ensemble Learning optimized Medical Image Classification with Deep Convolutional Neural Networks
On the Convergence of Heterogeneous Federated Learning with Arbitrary Adaptive Online Model Pruning
GreaseLM: Graph REASoning Enhanced Language Models for Question Answering
Evaluating Machine Common Sense via Cloze Testing
출처: Papers with Code · CC BY-SA 4.0. 아카이브 자료와 새로 수집한 논문은 별도로 관리합니다.