Show, Attend and Tell: Neural Image Caption Generation with Visual Attention
Introduces deterministic soft and stochastic hard visual attention for image captioning.
Annotated bibliography
Original formulations and the research connected to them, with complete references and direct paper links.
31 papers
No matching papers. Try another phrase or reset the filters.
Introduces deterministic soft and stochastic hard visual attention for image captioning.
Uses differentiable graphical-model inference to attend over subsequences and syntactic trees.
Models alignment as a latent variable and learns approximate posterior inference through variational attention.
Uses an exponentially tilted reference distribution and noise-contrastive estimation for neural random-field language models.
Treats attention context vectors as Gaussian latent variables in a variational encoder-decoder.
Adds approximate first-order CRF inference and dynamic transitions to non-autoregressive sequence models.
Builds distributions over attention weights from normalized reparameterizable variables and learns them with Bayesian regularization.
Higher-order CRF cascades for parallel text generation, parameterized by one Markov Transformer.
Combines a fixed autoregressive language model with a learned sequence-level energy, NCE training, conditional generation by importance resampling, and likelihood bounds.
A benchmark for testing automatic story metrics, including human correlation, generalization, robustness, and sensitivity to different coherence errors.
Studies statistical discrimination of human and model text and incorporates learned discriminators into globally normalized generation.
Candidate lookup, parallel conditional edge scoring, and exact Viterbi decoding replace a deep translation decoder.
A framework for evaluating high-level text structure by comparing real and generated data in latent spaces defined by explicit generative critics. Experiments study discourse coherence, coreference, and topicality.
FSA-CDM combines fine-grained cross-modal sequence alignment, contextual modeling, and a contrast-augmented diffusion objective for markup-to-image generation.
Studies accumulated sampling errors in diffusion models and trains with perturbed inputs to simulate inference-time prediction errors.
LiveVariables expose optimization parameters through designated system ports for real-time adjustment without restarting the optimization loop.
Learns to render LaTeX, HTML table layouts, LilyPond music notation, and SMILES molecules with conditional diffusion. Scheduled sampling exposes denoisers to their own generated inputs to address compounding errors.
Learns a reusable decision tree whose internal decisions are prompted language-model calls, with few-shot, instruction and dynamically generated prompt candidates.
Aug-Tree uses language-model-generated expansions to construct interpretable text features for tree splits.
Builds decision trees with LLM-assisted splits and incorporates expert feedback to revise decision paths.
A survey of story-quality criteria, human evaluation, automatic metrics, and evaluation benchmarks.
Learns classification trees of natural-language binary questions through impurity-based split selection and TextGrad refinement.
Adds a full-sequence residual energy to each diffusion denoising distribution, with autoregressive or NCE parameterizations and parallel importance sampling.
An open-source framework in which humans and AI agents intervene in ongoing neural-network training through a control server, changing optimizer settings, training data, and model checkpoints.
An asynchronous LLM supervisor observes training telemetry and proposes constrained changes to a running training recipe, with experiments on deliberately induced supervised-learning and reinforcement-learning failure modes.
CoDD composes factorized diffusion predictions with a tractable probabilistic-circuit prior to model joint token dependencies.
Adapts directed-acyclic dependency modeling to iterative diffusion using position-oriented candidate groups and fixed-token anchors.
Uses diffusion drafting, Causal-consistency Path Search over token lattices, and adaptive draft lengths.
A reusable protocol with typed settings, structured actions, application-selected control points, and an ordered journal shared by humans, scripts, and LLM controllers.
Scores adjacent compatibility among top-K parallel draft candidates and selects a draft through a cheap greedy walk.
Combines energy corrections for dependency and invariance in diffusion decoding.