TextWorld is a Python library for RL agents in text-based games.
problem Training RL agents on text-based games with varying challenges and sparse rewards.
method Developed a Python library with backend functions for state tracking and reward assignment. Enables users to create new games with precise control over difficulty and scope.
result Demonstrated the effectiveness of TextWorld in training RL agents on a curated list of games and generated sets of games.
This work trains a model to generate all valid commands for text-based games.
problem Generating valid commands for text-based games.
method Training generative models on a dataset of text-based game contexts.
result The best model can generate valid commands unseen at training and achieves high F1 score.
Improved RL for TBGs by pruning irrelevant tokens and bootstrapping.
problem RL methods fail to generalize in TBGs with small data.
method CREST for irrelevant token removal, bootstrapped Q-learning.
result Improved generalization in unseen TextWorld games.
LeDeepChef learns to play multiple cooking games well.
problem Designing a general RL agent for multiple games of the same family.
method Actor-critic framework, action-space pruning, hierarchical RL, specialized module.
result LeDeepChef outperformed competitors on a diverse set of cooking games.
Interactive game approach extracts action graphs from specialized text.
problem Action graph extraction from specialized procedural text.
method Interpreting procedural text as game instructions, using a learning agent to simulate and execute the procedure.
result Framework complements existing approaches and enables richer learning.
Q*BERT learns to navigate text-based games by building a knowledge graph.
problem Text-based games have bottlenecks that standard RL agents struggle to overcome.
method Q*BERT learns a knowledge graph and uses intrinsic motivation to detect and overcome bottlenecks.
result Q*BERT outperforms state-of-the-art agents in text games, including Zork.
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.
Optimal text-based indices track VIX and inflation.
problem Maximizing contemporaneous relation or predictive performance with target variables.
method Optimizing text-based indices focusing on VIX and inflation expectations.
result Superior performance compared to existing indices.
Study combines chit-chat and goal-oriented dialogue in fantasy games.
problem Combining naturalistic chit-chat with goal-oriented tasks in fantasy games.
method Trained a goal-oriented model with reinforcement learning against an imitation-learned chit-chat model using two approaches.
result Both models outperform a baseline and can converse naturally to achieve goals.
Study shows text-based news veracity models don't generalize across U.S. and U.K.
problem Generalizability of text-based news veracity detection models across countries.
method Testing news veracity models on U.S. and U.K. news data.
result Text-based classifiers perform poorly when trained on one country's news data and tested on another.
RecoBERT uses a language model to recommend items from catalogs.
problem Harnessing language models for text-based item recommendations.
method RecoBERT is a BERT-based approach that learns specialized language models for item recommendations without requiring labeled data.
result RecoBERT outperforms other techniques in inferring item similarities from textual catalogs.
This thesis evaluates text-based vs audio-based classification of mental health interviews.
problem Classifying psychiatric illness using text-based methods.
method Design and evaluate a text classification network on mental health interviews, using belabBERT.
result Text-based classification is a strong alternative to audio-based methods.
AE-DQN learns to eliminate sub-optimal actions in complex RL environments.
problem Challenges in RL with many actions, especially redundancy.
method Combines DQN with AEN that predicts invalid actions.
result Significant speedup and robustness in games with many actions.
New text as data techniques offer a great promise: the ability to inductively discover measures that are useful for testing social science theories of interest from large collections of text. We introduce a conceptual framework for making causal inferences with discovered measures as a treatment or outcome. Our framewo…
Paper tackles treatment leakage in text-based causal inference, proposing methods to mitigate bias.
problem Treatment leakage in text-as-confounder applications introduces bias in causal estimates.
method Formal definitions, four text distillation methods (passage removal, classification, salient feature removal, nullspace projection).
result Moderate distillation optimally balances bias reduction against confounder retention.
MoleculeSTM learns from molecule structures and texts for better drug design.
problem Lack of integration between chemical structures and textual knowledge in AI drug discovery.
method Jointly learns chemical structures and texts via contrastive learning, using a large dataset.
result MoleculeSTM achieves state-of-the-art performance in zero-shot tasks like structure-text retrieval and molecule editing.
GENs model generates sparse graphs from text-based inputs, achieving high validity.
problem Efficiently modeling and generating sparse graphs with unique and valid structures.
method RNN-based GENs model trained with an examination mechanism to predict graph characters.
result Moderate to high validity achieved in LGI strings for sparse graph generation.
WideDTA predicts drug-target binding affinity using text-based information.
problem Predicting drug-target binding affinity is a major challenge in drug discovery.
method WideDTA uses chemical and biological textual sequence information, including protein sequence, ligand SMILES, protein domains and motifs, and maximum common substructure words.
result WideDTA outperformed DeepDTA on the KIBA dataset, indicating the word-based sequence representation is a promising alternative.
Study enhances cryptocurrency sentiment analysis using TikTok and Twitter data.
problem Lack of comprehensive sentiment analysis in cryptocurrency markets.
method Multimodal analysis of TikTok and Twitter data using large language models.
result TikTok's video sentiment influences speculative assets and short-term trends.
Study improves cryptocurrency price prediction using unlabeled text data.
problem Predicting cryptocurrency returns from unlabelled text data.
method Introduced weak learning approach to finetune BERT on unlabeled text data.
result Finetuning pretrained NLP models with weak labels enhances forecast accuracy.
Text-based analysis methods allow to reveal privacy relevant author attributes such as gender, age and identify of the text's author. Such methods can compromise the privacy of an anonymous author even when the author tries to remove privacy sensitive content. In this paper, we propose an automatic method, called Adver…
TBIP uses texts to quantify lawmakers' political positions.
problem Quantifying lawmakers' political positions from speeches, tweets, etc.
method Unsupervised probabilistic topic model analyzing texts.
result TBIP separates lawmakers by party and infers ideal points close to vote-based.
Paper proposes HGAT for detecting fake news on HIN.
problem Viral spread of fake news causing social harm.
method Hierarchical Graph Attention Network (HGAT) for node representation learning in HIN.
result HGAT outperforms text-based and network-based models.
This study reviews text-based stock market analysis methods.
problem Insufficient analysis of unstructured textual data in stock market predictions.
method Reviews existing literature, covers data types, representation techniques, and analysis methods.
result Identifies open problems and suggests future research directions.
Simplified image clustering achieves competitive results without text-based embeddings.
problem Complexity and resource requirements of state-of-the-art clustering methods.
method SCP: trains a small cluster head using pre-trained vision model features and positive data pairs.
result SCP achieves highly competitive performance on various benchmark datasets.
We have applied the Zipf method to extract the ζ′ exponent for seven financial indices (DAX, FTSE; DJIA, NASDAQ, S&P500; Hang-Seng and Nikkei 225), after having translated the signals into a text based on two letters. We follow considerations based on the signal Hurst exponent and the notion of a time dependent Zipf …
Paper proposes ICCN to learn correlations between text, audio, and video for multimodal sentiment analysis.
problem Improving multimodal sentiment analysis by learning hidden correlations between text and audio/video features.
method Interaction Canonical Correlation Network (ICCN) using deep canonical correlation analysis (DCCA).
result Empirical results confirm the effectiveness of ICCN in capturing useful information from all three views.
SWIFT learns intrinsic rewards from LLM hidden states for efficient best-of-N sampling.
problem Efficiency and scalability of reward models for LLMs.
method SWIFT (Simple Weighted Intrinsic Feedback Technique) learns a reward function directly from LLM hidden states.
result SWIFT outperforms existing baselines by 12.7% on MATH dataset while using less than 0.005% of their parameters.
NegToMe uses images to guide text-based models away from unwanted visual elements.
problem Insufficient text-based adversarial guidance for complex visual concepts.
method Negative token merging (NegToMe) using visual features from reference images.
result Significantly enhances output diversity and reduces visual similarity to copyrighted content.
The group affect or emotion in an image of people can be inferred by extracting features about both the people in the picture and the overall makeup of the scene. The state-of-the-art on this problem investigates a combination of facial features, scene extraction and even audio tonality. This paper combines three addit…
Visual analogies help transfer knowledge between Atari games.
problem Can visual analogies transfer knowledge between Atari games?
method Created visual analogies between pairs of Atari games and used them to train policies for one game using data from another.
result Visual analogies can be used to transfer knowledge between Atari games.
Paper presents content-based models for game recommendation in cold start scenarios.
problem Cold start problem in game recommendation where new games and players have no historical data.
method Uses survey data to develop content-based interaction models that generalize to new games, players, and both.
result Content models outperform collaborative filtering in predicting new interactions.
Potential games, originally introduced in the early 1990's by Lloyd Shapley, the 2012 Nobel Laureate in Economics, and his colleague Dov Monderer, are a very important class of models in game theory. They have special properties such as the existence of Nash equilibria in pure strategies. This note introduces graphical…
A new framework for playing and learning board games.
problem Tackling the tedious and repetitive aspects of coding for board game AI.
method Developed a generic TD(λ)-n-tuple agent for arbitrary board games. result TD(λ)-n-tuple outperforms other generic agents on various games. IGGP learns game rules from varying quality game play, finding no overall trend.
problem Learn game rules from varying quality game play.
method Used Sancho's intelligent game traces and ILP systems (Metagol, Aleph, ILASP) to induce game rules from traces of varying quality and volume.
result No overall trend in accuracy of learned game rules from varying quality and volume of training data.
New game introduces linking-unlinking strategy for two-component links.
problem Tackling the linking and unlinking of two-component links.
method Introducing and analyzing the Linking-Unlinking Game on various link shadows.
result Winning strategies for specific link shadows are presented.
A game on diagrams switches crossing directions to achieve connectedness.
problem Achieving connectedness in diagrams through crossing switches.
method Players switch crossing directions on regions of a diagram to achieve connectedness.
result Connectedness can be achieved through strategic crossing switches.
Paper evaluates using app images for classification, improving accuracy.
problem Improving app classification accuracy when text descriptions are missing or inadequate.
method Used OCR, pic2vec, captionbot.ai, and object detection to convert images into text or vectors for classification.
result Improved classification accuracy of 96% for some app categories when images are added.
Introduces SM-games to analyze machine learning interactions.
problem Lack of understanding and control in n-player games.
method Introduces SM-games with pairwise zero-sum interactions.
result SM-games are amenable to first-order optimization methods.
Study earnings calls to predict stock price movements, finding them more predictive than traditional data.
problem Improving investment decisions by analyzing earnings calls for stock price predictions.
method Graph Neural Network based approach to process and analyze earnings call transcripts.
result Earnings call transcripts are more predictive of stock price movements than traditional hard data.
Just as war is sometimes fallaciously represented as a zero sum game -- when in fact war is a negative sum game - stock market trading, a positive sum game over time, is often erroneously represented as a zero sum game. This is called the "zero sum fallacy" -- the erroneous belief that one trader in a stock market exch…
The existence of stationary Markov perfect equilibria in stochastic games is shown under a general condition called "(decomposable) coarser transition kernels". This result covers various earlier existence results on correlated equilibria, noisy stochastic games, stochastic games with finite actions and state-independe…
Extracts credit-relevant information from earnings calls.
problem Investors do not fully internalize credit-relevant information from earnings calls.
method Develops a novel technique to extract credit-relevant information from earnings call text.
result The extracted information forecasts future credit spread changes and firm profitability.
Game theory helps analyze ESOs/EBIs in production and service sectors.
problem Economic incentives affect traditional production/service functions and create intangible capital.
method Uses game theory to analyze interactions in ESO/EBI transactions.
result No perfect Nash Equilibria for two-stage games involving many participants.
We start briefly surveying research on optimal stopping games since their introduction by E.B.Dynkin more than 40 years ago. Recent renewed interest to dynkin's games is due, in particular, to the study of Israeli (game) options introduced in 2000. We discuss the work on these options and related derivative securities …
The paper explores how regularization can lead to convergence in imperfect information games.
problem Finding equilibrium in imperfect information games with imperfect information.
method Investigates Follow the Regularized Leader dynamics and how adding a regularization term can lead to strong convergence guarantees.
result The approach leads to algorithms that converge exactly to the Nash equilibrium in imperfect information games.
Educational game on crypto investment helps students grasp macroeconomics.
problem Weak connections between microeconomic decision-making and macroeconomic concepts in classroom games.
method Design and study of an educational game on cryptocurrency investment.
result Engages students in understanding macroeconomics through incentivized individual investment decisions.
Simplified NFT games discussed with methods for extracting value.
problem Issues influencing NFT games' structure and stability.
method Three methods for extracting value from NFT games.
result Various design constraints and mutual beneficial games.