TellWorldAI World Archive

Home›Papers

Papers

Papers

Papers that changed AI, with a plain-language explainer for each.

Total 23 · Clear filters

  1. 2026

    GLM-5: from Vibe Coding to Agentic Engineering

    arXiv

    Zhipu's GLM-5 report describes a 744-billion-parameter mixture-of-experts model built on sparse attention and asynchronous reinforcement learning, aimed at moving AI-assisted programming from vibe coding toward agentic engineering.

    Large language modelsChinaAgents & tool use

  2. 2026

    Terminal-Bench: Benchmarking Agents on Hard, Realistic Tasks in Command Line Interfaces

    arXiv

    Terminal-Bench 2.0 is a curated benchmark of 89 hard tasks carried out in computer terminal environments, built to measure how well AI agents handle realistic command-line work; frontier models and agents score below 65% on it.

    Research historyAgents & tool useCode

  3. 2024

    FlashAttention-3: Fast and Accurate Attention with Asynchrony and Low-precision

    arXiv

    FlashAttention-3 is an attention algorithm for NVIDIA Hopper (H100) GPUs that reaches up to 75% utilization in FP16 and close to 1.2 PFLOPs/s in FP8, using asynchronous execution and low-precision techniques.

    Research historyDeep learningDeveloper tools

  4. 2024

    LiveCodeBench: Holistic and Contamination Free Evaluation of Large Language Models for Code

    arXiv

    A benchmark for code LLMs that keeps collecting fresh contest problems from LeetCode, AtCoder and CodeForces, so that scores reflect ability rather than memorised test data, and that also tests code repair and execution reasoning.

    Large language modelsResearch historyData & datasets

  5. 2023

    SWE-bench: Can Language Models Resolve Real-World GitHub Issues?

    arXiv

    A benchmark of 2,294 real software engineering problems taken from GitHub issues and the pull requests that resolved them, in which a model must edit a codebase to fix an issue; on release the best model solved under 2% of them.

    Research historyAgents & tool useData & datasets

  6. 2023

    FlashAttention-2: Faster Attention with Better Parallelism and Work Partitioning

    arXiv

    FlashAttention-2 is a 2023 revision of the FlashAttention attention kernel that reorganizes work across GPU thread blocks and warps, roughly doubling speed and reaching up to 73% of the A100's theoretical peak throughput.

    Research historyDeep learningDeveloper tools

  7. 2023

    QLoRA: Efficient Finetuning of Quantized LLMs

    arXiv

    QLoRA is a finetuning method that trains a 65B-parameter language model on a single 48GB GPU while matching full 16-bit finetuning quality, using 4-bit quantization, double quantization and paged optimizers.

    Large language modelsResearch historyDeveloper tools

  8. 2022

    FlashAttention: Fast and Memory-Efficient Exact Attention with IO-Awareness

    arXiv

    FlashAttention is an exact attention algorithm built around GPU memory traffic: by tiling computation so intermediates stay on chip, it cuts reads and writes to high bandwidth memory, training Transformers faster and enabling longer sequences.

    Research historyDeep learningDeveloper tools

  9. 2021

    Program Synthesis with Large Language Models (MBPP)

    arXiv

    A 2021 arXiv paper by Austin, Odena, Nye and eight other authors that introduced MBPP, a benchmark of 974 short Python programming tasks, and measured how language models from 244M to 137B parameters turn natural-language descriptions into working code.

    Large language modelsResearch historyData & datasets

  10. 2021

    Evaluating Large Language Models Trained on Code (Codex / HumanEval)

    arXiv

    A 2021 paper from OpenAI introduces Codex, a GPT model fine-tuned on public GitHub code, and HumanEval, an evaluation set that judges generated Python programs by whether they work rather than by how closely they match a reference.

    Large language modelsResearch historyData & datasets

  11. 2021

    LoRA: Low-Rank Adaptation of Large Language Models

    arXiv

    LoRA is a fine-tuning method that freezes a pre-trained model's weights and trains small low-rank matrices injected into each layer, cutting trainable parameters and memory by orders of magnitude.

    Large language modelsResearch historyDeveloper tools

  12. 2020

    GShard: Scaling Giant Models with Conditional Computation and Automatic Sharding

    arXiv

    GShard, submitted to arXiv in June 2020, is a set of annotation APIs and an XLA compiler extension from Google that lets existing model code express parallel computation, scaling a sparsely gated mixture-of-experts translation model past 600 billion parameters.

    Large language modelsResearch historyDeveloper tools

  13. 2011

    Torch7: A Matlab-like Environment for Machine Learning

    A 2011 workshop paper by Ronan Collobert, Koray Kavukcuoglu and Clement Farabet describing Torch7, a Lua-based numeric computing framework and machine learning library built for flexible experimentation on fast low-level kernels.

    Research historyOpen sourceDeep learning

  14. 2010

    Understanding the difficulty of training deep feedforward neural networks

    AISTATS / PMLR

    A 2010 paper by Xavier Glorot and Yoshua Bengio on why deep feedforward networks are hard to train: sigmoid saturation under random initialization and layer Jacobians whose singular values sit far from 1, plus a new initialization scheme that converges substantially faster.

    Research historyDeep learningDeveloper tools

  15. 2004

    MapReduce: Simplified Data Processing on Large Clusters

    OSDI

    Jeffrey Dean and Sanjay Ghemawat's 2004 OSDI paper presents MapReduce, a programming model in which users write a map function and a reduce function while the run-time system parallelizes the work across large clusters of commodity machines.

    Research historyData & datasetsDeveloper tools

  16. 1969

    Perceptrons: An Introduction to Computational Geometry

    A 1969 book by Marvin Minsky and Seymour Papert that proved mathematical limits on what single-layer perceptrons can compute — notably that they cannot compute parity or connectedness — and has long been credited with steering research away from neural networks.

    Research historyDeep learningScience

  17. 1966

    ELIZA - A Computer Program for the Study of Natural Language Communication Between Man and Machine

    Communications of the ACM 9(1)

    A January 1966 paper by Joseph Weizenbaum presenting ELIZA, a program on MIT's MAC time-sharing system that used keyword-triggered decomposition and reassembly rules to enable certain natural-language conversations between people and computers.

    Research historyScienceSymbolic AI

  18. 1961

    Steps Toward Artificial Intelligence

    Proceedings of the IRE 49(1)

    Marvin Minsky's 1961 survey in Proceedings of the IRE organized heuristic programming into five problem areas — search, pattern recognition, learning, planning and induction — and argued that machines would need to build models of their environments.

    Research historyReasoningSymbolic AI

  19. 1959

    Some Studies in Machine Learning Using the Game of Checkers

    IJRD

    A. L. Samuel's 1959 paper reporting experiments in which a checkers program, given only the rules of the game and an imperfect set of parameters, learned in 8 to 10 hours of playing time to beat the person who wrote it.

    Research historyScienceSymbolic AI

  20. 1959

    Programs with Common Sense

    PSMTPNPL

    John McCarthy's 1959 paper proposing the advice taker, a program that would solve problems by manipulating sentences in formal languages and act when it deduced an imperative — an early statement of logical AI.

    Research historyReasoningSymbolic AI