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.
논문
이 태스크와 하위 분야의 관련 논문입니다. 실제 성능 비교는 평가 결과에서 확인하세요.
The Role of Relevance in Fair Ranking
Masked Structural Growth for 2x Faster Language Model Pre-training
Idioms, Probing and Dangerous Things: Towards Structural Probing for Idiomaticity in Vector Space
Development of a Trust-Aware User Simulator for Statistical Proactive Dialog Modeling in Human-AI Teams
Evolving Three Dimension (3D) Abstract Art: Fitting Concepts by Language
Image retrieval outperforms diffusion models on data augmentation
How the Move Acceptance Hyper-Heuristic Copes With Local Optima: Drastic Differences Between Jumps and Cliffs
Behavior Retrieval: Few-Shot Imitation Learning by Querying Unlabeled Datasets
Shall We Pretrain Autoregressive Language Models with Retrieval? A Comprehensive Study
Last-Layer Fairness Fine-tuning is Simple and Effective for Neural Networks
Lipschitz Continuity of Signal Temporal Logic Robustness Measures: Synthesizing Control Barrier Functions from One Expert Demonstration
Krylov Methods are (nearly) Optimal for Low-Rank Approximation
AutoRL Hyperparameter Landscapes
Time Series Contrastive Learning with Information-Aware Augmentations
Feature representations useful for predicting image memorability
Understanding and Constructing Latent Modality Structures in Multi-modal Representation Learning
SLCA: Slow Learner with Classifier Alignment for Continual Learning on a Pre-trained Model
Data-Efficient Training of CNNs and Transformers with Coresets: A Stability Perspective
Graph Reinforcement Learning for Operator Selection in the ALNS Metaheuristic
Cross-modal Face- and Voice-style Transfer
Optimal Prediction Using Expert Advice and Randomized Littlestone Dimension
Cross-modal Contrastive Learning for Multimodal Fake News Detection
Multi-Message Shuffled Privacy in Federated Learning
Selectively Providing Reliance Calibration Cues With Reliance Prediction
Data-Efficient Contrastive Self-supervised Learning: Most Beneficial Examples for Supervised Learning Contribute the Least
Minimizing Dynamic Regret on Geodesic Metric Spaces
Deterministic Nonsmooth Nonconvex Optimization
Paparazzi: A Deep Dive into the Capabilities of Language and Vision Models for Grounding Viewpoint Descriptions
Analyzing the Effectiveness of the Underlying Reasoning Tasks in Multi-hop Question Answering
Convergence of the Euler--Maruyama particle scheme for a regularised McKean--Vlasov equation arising from the calibration of local-stochastic volatility models
Fast, Sample-Efficient, Affine-Invariant Private Mean and Covariance Estimation for Subgaussian Distributions
A Robust Optimisation Perspective on Counterexample-Guided Repair of Neural Networks
Predicting attractors from spectral properties of stylized gene regulatory networks
Doubly Adversarial Federated Bandits
Accelerating Multi-Agent Planning Using Graph Transformers with Bounded Suboptimality
출처: Papers with Code · CC BY-SA 4.0. 아카이브 자료와 새로 수집한 논문은 별도로 관리합니다.