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.
논문
이 태스크와 하위 분야의 관련 논문입니다. 실제 성능 비교는 평가 결과에서 확인하세요.
Synergy and Symmetry in Deep Learning: Interactions between the Data, Model, and Inference Algorithm
Cross-Lingual QA as a Stepping Stone for Monolingual Open QA in Icelandic
The Parallelism Tradeoff: Limitations of Log-Precision Transformers
Optimizing Video Prediction via Video Frame Interpolation
Tackling Spoofing-Aware Speaker Verification with Multi-Model Fusion
When Does Adaptivity Help for Quantum State Learning?
Learning to Rank Rationales for Explainable Recommendation
Learning to generate imaginary tasks for improving generalization in meta-learning
A general approximation lower bound in $L^p$ norm, with applications to feed-forward neural networks
Clustering with Queries under Semi-Random Noise
Benchmarking Bayesian neural networks and evaluation metrics for regression tasks
Scaling laws in global corporations as a benchmarking approach to assess environmental performance
Nearly Optimal Best-of-Both-Worlds Algorithms for Online Learning with Feedback Graphs
Is Mapping Necessary for Realistic PointGoal Navigation?
Split-kl and PAC-Bayes-split-kl Inequalities for Ternary Random Variables
3PSDF: Three-Pole Signed Distance Function for Learning Surfaces with Arbitrary Topologies
Most Equitable Voting Rules
Point-M2AE: Multi-scale Masked Autoencoders for Hierarchical Point Cloud Pre-training
HOUDINI: Escaping from Moderately Constrained Saddles
kNN-Prompt: Nearest Neighbor Zero-Shot Inference
Mirror Descent Maximizes Generalized Margin and Can Be Implemented Efficiently
Beyond EM Algorithm on Over-specified Two-Component Location-Scale Gaussian Mixtures
POLTER: Policy Trajectory Ensemble Regularization for Unsupervised Reinforcement Learning
Learning Progress Driven Multi-Agent Curriculum
Towards biologically plausible Dreaming and Planning in recurrent spiking networks
Memorization and Optimization in Deep Neural Networks with Minimum Over-parameterization
The First Optimal Acceleration of High-Order Methods in Smooth Convex Optimization
Pareto-Optimal Fairness-Utility Amortizations in Rankings with a DBN Exposure Model
Bacteriophage effect on parasitism resistance
Language Models Can See: Plugging Visual Controls in Text Generation
Testing the Ability of Language Models to Interpret Figurative Language
Human-AI Collaboration via Conditional Delegation: A Case Study of Content Moderation
A Computational Theory of Learning Flexible Reward-Seeking Behavior with Place Cells
Topology and geometry of data manifold in deep learning
Revisiting Vicinal Risk Minimization for Partially Supervised Multi-Label Classification Under Data Scarcity
출처: Papers with Code · CC BY-SA 4.0. 아카이브 자료와 새로 수집한 논문은 별도로 관리합니다.