Neural Programmer learns natural language queries for databases.
problem Natural language interface learning for database queries.
method Enhanced Neural Programmer model trained on weak supervision.
result Single Neural Programmer model achieves 34.2% accuracy.
Seq2Seq models perform well in generating If-Then programs from natural language.
problem Creating If-Then programs for business process automation without technical expertise.
method Modeling If-Then programs as a sequence learning task using Seq2Seq approaches.
result Seq2Seq models can effectively generate If-Then programs from natural language.
FairLangProc simplifies fairness in NLP models for Python users.
problem Addressing bias in NLP models for decision-making contexts.
method Develops a Python package for implementing fairness metrics and algorithms.
result Promotes the use of bias mitigation techniques in NLP.
SAPS synthesizes code from natural language specifications.
problem Efficiently translating complex NL specifications into executable code.
method Structure-aware neural network using abstract syntax trees and LSTM.
result SAPS produces correct programs in over 92% of cases.
LLMs can help explain credit risk models but not autonomously.
problem Leveraging LLMs for post-hoc explainability in credit risk models.
method Comparison of LLM outputs with SHAP and coefficient-based attributions on three LMs.
result LLMs reliably preserve feature-importance rankings but poorly align with autonomous explanations.
Model uses LLMs to process numerical data guided by natural language descriptions.
problem Challenges in integrating prior knowledge into probabilistic models.
method Developed LLM Processes to condition numerical predictive distributions on natural language.
result Improved predictive performance and structured qualitative descriptions.
MA-DST improves multi-domain dialog state tracking.
problem Accurate multi-domain dialog state tracking in natural language interfaces.
method Multi-attention based architecture to encode conversation history and slot semantics.
result Improves joint goal accuracy by 5% in full-data setting and up to 2% in zero-shot setting.
Quantum probability theory reveals hidden structure in joint probability distributions.
problem Understanding hidden structure in joint probability distributions.
method Modeling joint probability distributions as density operators and applying partial trace.
result Decoding extra information in reduced density operators that captures subsystem interactions.
Study shows diffused interface flows to single diffused balls over time.
problem Volume-preserving mean curvature flow in Euclidean space.
method Diffused interface version, exponential convergence proof.
result Exponential convergence to single diffused balls.
A new method uses LLMs to improve Bayesian optimization without requiring prior knowledge.
problem Improving Bayesian optimization with richer domain priors.
method Introducing agentic Bayesian optimization with an LLM agent as the central decision maker.
result Sara outperforms standard BO and LLM-based baselines, improving optimization with natural-language priors.
Neural User Simulator outperforms traditional ABUS in training dialogue systems.
problem Limited diversity and lack of natural language in ABUS.
method NUS learns user behavior from a corpus and generates natural language.
result NUS trained policies outperform ABUS in real user evaluations.
MLJ offers a Julia package for composing machine learning models.
problem Complex model composition in machine learning.
method Flexible model composition tools and meta-algorithms.
result Clear benefits of Julia over multi-language alternatives.
Paper proposes a new framework for hypothesis testing in imaging.
problem Challenges in hypothesis testing for imaging data.
method Combines self-supervised imaging, vision-language models, and non-parametric hypothesis testing.
result Demonstrates improved power and robust error control in image-based phenotyping.
New models avoid lookahead bias by training on past data only.
problem Lookahead bias in language models.
method Chronologically consistent training on data before a knowledge-cutoff date.
result Elimination of lookahead bias in predictions.
A discrete method approximates hyperbolic curvature flow in the plane.
problem Modeling wave phenomena in solid-liquid interfaces.
method Semidiscrete finite difference method for hyperbolic curvature flow.
result Error bounds for natural discrete norms are proven.
Study motion of discrete interfaces on triangular lattice using Almgren, Taylor, and Wang's approach.
problem Motion of discrete interfaces on triangular lattice driven by ferromagnetic interactions.
method Coupling Almgren, Taylor, and Wang's minimizing movements approach with Braides, Gelli, and Novaga's discrete-to-continuum analysis.
result Limit motion of origin-symmetric convex hexagons compared to crystalline curvature evolution.
dynestyx: A library for probabilistic programming of dynamical systems
problem integrating state-space models into probabilistic programming languages
method a unified interface for specifying priors and performing inference
result principled uncertainty quantification for state and parameters
Analytic patch trees reveal new geometric structures and dimension fields.
problem Understanding the geometric and analytical properties of surface patch trees.
method Developed analytic surface patch trees and introduced interface curves to transmit state.
result Surface patch trees have natural foliations with one-dimensional curve trees and dimension fields.
The workshop explores AI and neuroscience, focusing on complex stimuli and neural network models.
problem Understanding and modeling brain function using AI and machine learning.
method Combining cognitive neuroscience with AI techniques like deep learning and attention mechanisms.
result The need for rich vector representations of stimuli for effective machine learning.
A new language for neural architecture search decouples search spaces and algorithms.
problem Current neural architecture search methods are limited to specific use-cases and lack general-purpose constructs.
method Proposes a formal language for encoding search spaces over general computational graphs, allowing modular, composable, and reusable encodings.
result The language enables easy experimentation with different search spaces and algorithms without reinventing the wheel.
New BMI interface stabilizes user experience over long periods.
problem Inconsistent neural signal data leads to interface recalibration.
method Adversarial Domain Adaptation Network to match residual distributions.
result Adversarial Domain Adaptation Network outperforms other methods.
Automates API mapping across languages with minimal manual effort.
problem Manual effort required to identify parallel program corpora and API mappings.
method Combines domain adaptation and code embedding with GANs to align vector spaces of APIs.
result Automatically identifies cross-language API mappings with less prior knowledge.
Open-source Vizier optimizes complex systems for Google and beyond.
problem Optimizing large-scale systems with multiple objectives and constraints.
method Distributed, fault-tolerant, flexible API for blackbox optimization.
result OSS Vizier supports a wide range of optimization problems and is available as open-source.
SG-DNI outperforms standard neural interfaces in speed and accuracy.
problem Inflexible structure of neural networks limits parallelization.
method Introduces synthetic gradients with decoupled neural interfaces (SG-DNI).
result SG-DNI is over 3-fold faster with comparable accuracy.
This is a lecture note for the course DS-GA 3001 <Natural Language Understanding with Distributed Representation> at the Center for Data Science , New York University in Fall, 2015. As the name of the course suggests, this lecture note introduces readers to a neural network based approach to natural language understand…
A new sampler for FLMs improves token-level decoding controls.
problem Sampling from FLMs using standard methods collapses marginals and produces invalid sequences.
method Samples clean one-hot endpoints from FLM token marginals and uses Ornstein-Uhlenbeck bridges conditioned on these endpoints.
result The method preserves token-wise posterior-predictive marginals and improves quality-diversity tradeoff.
Paper reviews neurolinguistics and language technologies, emphasizing mutual enrichment.
problem Understanding brain activity during language processing.
method Brain imaging studies and natural language representations.
result Development of brain-aware natural language representations.
MAX simplifies access to DL models for non-experts.
problem Difficulty for non-experts in adopting latest DL models.
method Proposes MAX, a Python library that wraps DL models and provides RESTful APIs.
result Maximizes ease of using state-of-the-art DL models for inference.
KG-A2C agent learns natural language IF games by reasoning and constraining action spaces.
problem Challenges of natural language understanding, partial observability, and combinatorially large action spaces in IF games.
method Builds a dynamic knowledge graph while exploring, constraining actions using templates.
result Outperforms current IF agents across various games with larger action spaces.
LYRICS integrates deep learning and logic inference for complex decision-making.
problem Combining deep learning with symbolic logic for intelligent decision-making.
method LYRICS provides a generic interface layer that integrates TF models with FOL knowledge, converting constraints into optimization problems.
result LYRICS enables learning under logical constraints, improving model performance and decision-making.
PixL2R maps natural language to pixel-based rewards for RL, improving sample efficiency.
problem Sparse reward settings in RL limit applicability to complex problems.
method Directly maps natural language descriptions to pixel-based rewards for guiding RL.
result Language-based rewards significantly improve sample efficiency in policy learning.
Deep RL algorithms tested on diverse video games.
problem Benchmarking AI on diverse video games.
method Interface GVGAI to OpenAI Gym, test deep RL algorithms.
result Characterized performance of deep RL algorithms on GVGAI games.
Improved robot navigation using multi-head attention for natural language instructions.
problem Improving robot navigation in unfamiliar environments.
method Proposes a multi-head attention mechanism blending layer in a neural network model.
result Significant performance gains in translating instructions for unseen environments.
PHINN: A generative model for rare-event time series using persistent homology
problem Generating rare events in time series
method Flow-matching framework with dynamic Betti curves and persistence landscape loss
result Outperforms statistical and diffusion baselines in topological fidelity and tail coverage
MAC Net improves natural language question answering with data-driven reasoning.
problem Natural Language Question Answering requires complex reasoning.
method MAC Net architecture separates memory and control for iterative reasoning.
result MAC Net achieves high efficiency and interpretability in NLP tasks.
LLMs translate natural language trading intents into correct option strategies using a domain-specific language.
problem Challenges in translating natural language trading intents into correct option strategies due to the complexity of option chain data.
method Introduce Option Query Language (OQL) as a domain-specific intermediate representation to abstract option markets into high-level primitives under grammatical rules. Use LLMs as semantic parsers and validate queries by an engine.
result Significantly improves execution accuracy and logical consistency over direct baselines.
Automates translating natural language to Verilog for digital design.
problem Manual translation of natural language specifications to Verilog is time-consuming and error-prone.
method Fine-tuned GPT-2 to derive Verilog from English, using a dataset of design tasks.
result GPT-2 achieved 94.8% correct translation across simple and abstract design tasks.
NumPyro accelerates probabilistic programming with JAX transformations.
problem Efficiently handling probabilistic models with hardware acceleration.
method Composable effects and program transformations in JAX.
result Iterative NUTS formulation JIT compiled for speed.
BCI system improves word selection efficiency using sequential best-arm identification.
problem Conventional non-adaptive BCI paradigms lead to a lengthy learning process.
method Casted as sequence of best-arm identification tasks in multi-armed bandits, using pre-trained LLMs and STTS algorithm.
result Substantial empirical improvement in word selection efficiency demonstrated.
Graph database outperforms in filtering ESG stocks efficiently.
problem Efficiently filtering ESG stocks from large lists of equities.
method Compared SQL, No-SQL, and graph databases; used Python for database interactions; collected data from stock price and financial news.
result Graph database is more efficient for ESG stock filtering.
This study applies neural models to automatically recognize medical entities from natural language.
problem Automated recognition of medical entities from natural language is complex and time-consuming.
method Utilizes deep neural sequence models trained on a large dataset of death certificates.
result Deep neural models can efficiently recognize medical entities from natural language.
The study enhances financial rule matching using NLP without datasets.
problem Performing semantic matching between financial rules and policies.
method Outperforming pre-trained models with NLP techniques using free resources.
result Improved semantic matching between financial rules and policies.
Language models learn from training data and can leak private information.
problem Language models lack context understanding and can expose private data.
method Discussing the limitations of current privacy protection methods for language models.
result Existing privacy protection methods are insufficient for language models.
UR-FUNNY dataset aids in understanding multimodal humor.
problem Understanding humor in a multimodal context is understudied.
method Developed a multimodal dataset (UR-FUNNY) for humor detection.
result UR-FUNNY opens the door to multimodal humor detection research.
Generative model learns motion to language and vice versa using deep RNNs.
problem Linking human motion and natural language for semantic representations and robot behaviors.
method Bidirectional mapping between motion and language using deep recurrent neural networks (RNNs) and sequence-to-sequence learning.
result Model generates realistic motions from natural language descriptions and vice versa.
Natural language guides reinforcement learning exploration in games.
problem Improving reinforcement learning in unseen environments.
method Used encoder-decoder networks to learn associations between natural language and state-action information, then applied this to guide agent exploration.
result Modified policy shaping algorithm outperformed Q-learning and baseline policy shaping in Frogger.
Natural language instructions improve reinforcement learning efficiency.
problem Designing effective reward functions for reinforcement learning is difficult and time-consuming.
method Proposes LanguagE-Action Reward Network (LEARN) to map natural language instructions to intermediate rewards.
result Language-based rewards lead to successful task completion 60% more often than without language.
RL benefits from natural language understanding, surveying recent advances.
problem Exploit natural language to enhance RL performance.
method Survey recent research integrating natural language with RL.
result Natural language can improve RL's world knowledge and task transfer.