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.
논문
이 태스크와 하위 분야의 관련 논문입니다. 실제 성능 비교는 평가 결과에서 확인하세요.
Evaluating the Faithfulness of Importance Measures in NLP by Recursively Masking Allegedly Important Tokens and Retraining
SoGCN: Second-Order Graph Convolutional Networks
Rethinking Supervised Pre-training for Better Downstream Transferring
A Few More Examples May Be Worth Billions of Parameters
Noisy Text Data: Achilles' Heel of popular transformer based NLP models
A Model Selection Approach for Corruption Robust Reinforcement Learning
Attention module improves both performance and interpretability of 4D fMRI decoding neural network
LexGLUE: A Benchmark Dataset for Legal Language Understanding in English
Radical pairs may play a role in microtubule reorganization
Superquadric Object Representation for Optimization-based Semantic SLAM
RSI-Net: Two-Stream Deep Neural Network for Remote Sensing Imagesbased Semantic Segmentation
Local Augmentation for Graph Neural Networks
Is Machine Learning Ready for Traffic Engineering Optimization?
What do pre-trained code models know about code?
Integrating Transductive And Inductive Embeddings Improves Link Prediction Accuracy
EKTVQA: Generalized use of External Knowledge to empower Scene Text in Text-VQA
Mounting Video Metadata on Transformer-based Language Model for Open-ended Video Question Answering
Optimal Transport for Unsupervised Denoising Learning
Predicting Zip Code-Level Vaccine Hesitancy in US Metropolitan Areas Using Machine Learning Models on Public Tweets
What do neuroanatomical networks reveal about the ontology of human cognitive abilities?
Learned Sorted Table Search and Static Indexes in Small Model Space
Single Pass Entrywise-Transformed Low Rank Approximation
Near-Optimal Algorithms for Linear Algebra in the Current Matrix Multiplication Time
Continuous vs. Discrete Optimization of Deep Neural Networks
Likelihood-Free Frequentist Inference: Bridging Classical Statistics and Machine Learning for Reliable Simulator-Based Inference
MD-split+: Practical Local Conformal Inference in High Dimensions
A Theory of the Distortion-Perception Tradeoff in Wasserstein Space
A Note on Utility Maximization with Proportional Transaction Costs and Stability of Optimal Portfolios
Explanation-Guided Diagnosis of Machine Learning Evasion Attacks
In-distribution adversarial attacks on object recognition models using gradient-free search
The Convergence Rate of SGD's Final Iterate: Analysis on Dimension Dependence
Nonparametric estimation of continuous DPPs with kernel methods
Sparsistent Model Discovery
Towards a Query-Optimal and Time-Efficient Algorithm for Clustering with a Faulty Oracle
Embedding-based Product Retrieval in Taobao Search
출처: Papers with Code · CC BY-SA 4.0. 아카이브 자료와 새로 수집한 논문은 별도로 관리합니다.