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

Showing 551600 of 796 papers

TitleStatusHype
Near-Optimal Φ-Regret Learning in Extensive-Form Games0
NEON+: Accelerated Gradient Methods for Extracting Negative Curvature for Non-Convex Optimization0
Net-DNF: Effective Deep Modeling of Tabular Data0
NET-FLEET: Achieving Linear Convergence Speedup for Fully Decentralized Federated Learning with Heterogeneous Data0
Network-Density-Controlled Decentralized Parallel Stochastic Gradient Descent in Wireless Systems0
Neural Machine Translation with Noisy Lexical Constraints0
Neural Networks with Small Weights and Depth-Separation Barriers0
Neural Theory-of-Mind? On the Limits of Social Intelligence in Large LMs0
A Practical Algorithm for Multiplayer Bandits when Arm Means Vary Among Players0
New Insight into Hybrid Stochastic Gradient Descent: Beyond With-Replacement Sampling and Convexity0
New Scaling Relation for Information Transfer in Biological Networks0
Noisy, Greedy and Not So Greedy k-means++0
Noisy Text Data: Achilles' Heel of popular transformer based NLP models0
Non-asymptotic Confidence Intervals of Off-policy Evaluation: Primal and Dual Bounds0
Non-autoregressive Conditional Diffusion Models for Time Series Prediction0
Non-invasive Self-attention for Side Information Fusion in Sequential Recommendation0
Nonlinear Dimension Reduction via Outer Bi-Lipschitz Extensions0
Nonnegative Matrix Factorization Requires Irrationality0
Nonrobustness of asymptotic stability of impulsive systems with inputs0
Occlusion Fields: An Implicit Representation for Non-Line-of-Sight Surface Reconstruction0
On characterizations of learnability with computable learners0
On Distributed Differential Privacy and Counting Distinct Elements0
Online Lewis Weight Sampling0
Online Meta-learning by Parallel Algorithm Competition0
Online Prediction in Sub-linear Space0
Online Product Feature Recommendations with Interpretable Machine Learning0
On Merging Feature Engineering and Deep Learning for Diagnosis, Risk-Prediction and Age Estimation Based on the 12-Lead ECG0
On Query-efficient Planning in MDPs under Linear Realizability of the Optimal State-value Function0
On Sparsity in Overparametrised Shallow ReLU Networks0
On the Adversarial Robustness of Mixture of Experts0
On the Complexity of Detecting Convexity over a Box0
On the Convergence of A Class of Adam-Type Algorithms for Non-Convex Optimization0
On the Convergence of Heterogeneous Federated Learning with Arbitrary Adaptive Online Model Pruning0
On the Convergence of Monte Carlo UCB for Random-Length Episodic MDPs0
On the Convergence of Reinforcement Learning with Monte Carlo Exploring Starts0
On the Divergence of Decentralized Non-Convex Optimization0
On the Empirical Neural Tangent Kernel of Standard Finite-Width Convolutional Neural Network Architectures0
On the Global Convergence Rates of Softmax Policy Gradient Methods0
On the (In)tractability of Computing Normalizing Constants for the Product of Determinantal Point Processes0
On the Marginal Regret Bound Minimization of Adaptive Methods0
On the Practical Consistency of Meta-Reinforcement Learning Algorithms0
On the Role of Canonicity in Bottom-up Knowledge Compilation0
On the Value of Infinite Gradients in Variational Autoencoder Models0
On Universal Approximation by Neural Networks with Uniform Guarantees on Approximation of Infinite Dimensional Maps0
Open Question Answering with Weakly Supervised Embedding Models0
Optimal Bounds on the VC-dimension0
Optimal Learners for Multiclass Problems0
Optimal occlusion uniformly partitions red blood cells fluxes within a microvascular network0
Optimal Prediction Using Expert Advice and Randomized Littlestone Dimension0
Compositional optimization of quantum circuits for quantum kernels of support vector machines0
Show:102550
← PrevPage 12 of 16Next →

No leaderboard results yet.