Search Results for author:
Found 21 papers, 8 papers with code
Seed-Coder: Let the Code Model Curate Data for Itself
Code data in large language model (LLM) pretraining is recognized crucial not only for code-related tasks but also for enhancing general intelligence of LLMs.
Seed1.5-Thinking: Advancing Superb Reasoning Models with Reinforcement Learning
We introduce Seed1. 5-Thinking, capable of reasoning through thinking before responding, resulting in improved performance on a wide range of benchmarks.
Multi-SWE-bench: A Multilingual Benchmark for Issue Resolving
The task of issue resolving is to modify a codebase to generate a patch that addresses a given issue.
FullStack Bench: Evaluating LLMs as Full Stack Coders
As the capabilities of code large language models (LLMs) continue to expand, their applications across diverse code intelligence domains are rapidly increasing.
ICE-GRT: Instruction Context Enhancement by Generative Reinforcement based Transformers
The emergence of Large Language Models (LLMs) such as ChatGPT and LLaMA encounter limitations in domain-specific tasks, with these models often lacking depth and accuracy in specialized areas, and exhibiting a decrease in general capabilities when fine-tuned, particularly analysis ability in small sized models.
GPT-Fathom: Benchmarking Large Language Models to Decipher the Evolutionary Path towards GPT-4 and Beyond
With the rapid advancement of large language models (LLMs), there is a pressing need for a comprehensive evaluation suite to assess their capabilities and limitations.
GNN is a Counter? Revisiting GNN for Question Answering
To open the black box of GNN and investigate these problems, we dissect state-of-the-art GNN modules for QA and analyze their reasoning capability.
Ranked #12 on
Question Answering
on OpenBookQA
Speeding up Computational Morphogenesis with Online Neural Synthetic Gradients
We successfully apply our ONSG framework to computational morphogenesis, a representative and challenging class of PDE-constrained optimization problems.
Answering Any-hop Open-domain Questions with Iterative Document Reranking
Existing approaches for open-domain question answering (QA) are typically designed for questions that require either single-hop or multi-hop reasoning, which make strong assumptions of the complexity of questions to be answered.
Ranked #16 on
Question Answering
on HotpotQA
Question Directed Graph Attention Network for Numerical Reasoning over Text
Numerical reasoning over texts, such as addition, subtraction, sorting and counting, is a challenging machine reading comprehension task, since it requires both natural language understanding and arithmetic computation.
Ranked #1 on
Question Answering
on DROP Test
DC-BERT: Decoupling Question and Document for Efficient Contextual Encoding
Recent studies on open-domain question answering have achieved prominent performance improvement using pre-trained language models such as BERT.
Efficient Probabilistic Logic Reasoning with Graph Neural Networks
In this paper, we explore the combination of MLNs and GNNs, and use graph neural networks for variational inference in MLN.
Language Modeling with Shared Grammar
Sequential recurrent neural networks have achieved superior performance on language modeling, but overlook the structure information in natural language.
Can Graph Neural Networks Help Logic Reasoning?
Effectively combining logic reasoning and probabilistic inference has been a long-standing goal of machine learning: the former has the ability to generalize with small training data, while the latter provides a principled framework for dealing with noisy data.
KG^2: Learning to Reason Science Exam Questions with Contextual Knowledge Graph Embeddings
Our model learns to reason with neural embeddings of both knowledge graphs.
Variational Reasoning for Question Answering with Knowledge Graph
Knowledge graph (KG) is known to be helpful for the task of question answering (QA), since it provides well-structured relational information between entities, and allows one to further infer indirect facts.
Learning Combinatorial Optimization Algorithms over Graphs
The design of good heuristics or approximation algorithms for NP-hard combinatorial optimization problems often requires significant specialized knowledge and trial-and-error.
FLASH: Fast Bayesian Optimization for Data Analytic Pipelines
To achieve the best performance, it is often critical to select optimal algorithms and to set appropriate hyperparameters, which requires large computational efforts.
Large Scale Purchase Prediction with Historical User Actions on B2C Online Retail Platform
This paper describes the solution of Bazinga Team for Tmall Recommendation Prize 2014.
Sequential Click Prediction for Sponsored Search with Recurrent Neural Networks
Click prediction is one of the fundamental problems in sponsored search.
Combination of Diverse Ranking Models for Personalized Expedia Hotel Searches
The ICDM Challenge 2013 is to apply machine learning to the problem of hotel ranking, aiming to maximize purchases according to given hotel characteristics, location attractiveness of hotels, user's aggregated purchase history and competitive online travel agency information for each potential hotel choice.
