Search for: All records

Developing autonomous agents that can strategize and cooperate with humans under information asymmetry is challenging without effective communication in natural language. We introduce a shared-control game, where two players collectively control a token in alternating turns to achieve a common objective under incomplete information. We formulate a policy synthesis problem for an autonomous agent in this game with a human as the other player. To solve this problem, we propose a communication-based approach comprising a language module and a planning module. The language module translates natural language messages into and from a finite set of flags, a compact representation defined to capture player intents. The planning module leverages these flags to compute a policy using an asymmetric information-set Monte Carlo tree search with flag exchange algorithm we present. We evaluate the effectiveness of this approach in a testbed based on Gnomes at Night, a search-and-find maze board game. Results of human subject experiments show that communication narrows the information gap between players and enhances human-agent cooperation efficiency with fewer turns. 

The usage of Rational Speech Acts (RSA) framework has been successful in building pragmatic program synthesizers that return programs which, in addition to being logically consistent with user-generated examples, account for the fact that a user chooses their examples informatively. We present a general method of amortizing the slow, exact RSA synthesizer. Our method first compiles a communication dataset of partially ranked programs by querying the exact RSA synthesizer. It then distills a global ranking -- a single, total ordering of all programs, to approximate the partial rankings from this dataset. This global ranking is then used at inference time to rank multiple logically consistent candidate programs generated from a fast, non-pragmatic synthesizer. Experiments on two program synthesis domains using our ranking method resulted in orders of magnitudes of speed ups compared to the exact RSA synthesizer, while being more accurate than a non-pragmatic synthesizer. Finally, we prove that in the special case of synthesis from a single example, this approximation is exact. 

Biofluorescence has been found to be an increasingly widespread phenomenon in the ocean. The reclusive Caribbean chlopsid eel, Kaupichthys hyoproroides displays bright green fluorescence in its native marine environment. We have previously shown the fluorescence to be attributed to a fluorescent fatty acid-binding protein, Chlopsid FP, part of a larger family of fluorescent fatty acid-binding proteins, including the homologous UnaG. All require the addition of exogenous bilirubin for fluorescence. Here, we report the generation of a series of point mutants, and deletions that result in the quenching of fluorescence in Chlopsid FP. In addition, we report the binding constants of bilirubin to Chlopsid FP and mutants, measured by fluorescence titration. This study provides key insights into the potential mechanism of fluorescence in this class of fluorescent fatty acid-binding proteins.