Publications

Current State and Future Directions for Learning in Biological Recurrent Neural Networks: A Perspective Piece
Luke Y. Prince
Roy Henha Eyono
Ellen Boven
Arna Ghosh
Joseph Pemberton
Franz Scherr
Claudia Clopath
Rui Ponte Costa
Wolfgang Maass
Blake Richards
Cristina Savin
Katharina Wilmes
We provide a brief review of the common assumptions about biological learning with findings from experimental neuroscience and contrast them… (voir plus) with the efficiency of gradient-based learning in recurrent neural networks. The key issues discussed in this review include: synaptic plasticity, neural circuits, theory-experiment divide, and objective functions. We conclude with recommendations for both theoretical and experimental neuroscientists when designing new studies that could help bring clarity to these issues.
2022-04-27
Neurons, Behavior, Data analysis, and Theory (publié)
doi.org
arxiv.org
Accepted Tutorials at The Web Conference 2022
Riccardo Tommasini
Senjuti Basu Roy
Xuan Wang
Hongwei Wang
Heng Ji
Jiawei Han
Preslav Nakov
Giovanni Da San Martino
Firoj Alam
Markus Schedl
Elisabeth Lex
Akash Bharadwaj
Graham Cormode
Milan Dojchinovski
Jan Forberg
Johannes Frey
Pieter Bonte
Marco Balduini
Matteo Belcao
Emanuele Della Valle … (voir 53 de plus)
Junliang Yu
Hongzhi Yin
Tong Chen
Haochen Liu
Yiqi Wang
Wenqi Fan
Xiaorui Liu
Jamell Dacon
Lingjuan Lye
Jiliang Tang
Aristides Gionis
Stefan Neumann
Bruno Ordozgoiti
Simon Razniewski
Hiba Arnaout
Shrestha Ghosh
Fabian Suchanek
Lingfei Wu
Yu Chen
Yunyao Li
Bang Liu
Filip Ilievski
Daniel Garijo
Hans Chalupsky
Pedro Szekely
Ilias Kanellos
Dimitris Sacharidis
Thanasis Vergoulis
Nurendra Choudhary
Nikhil Rao
Karthik Subbian
Srinivasan Sengamedu
Chandan K. Reddy
Friedhelm Victor
Bernhard Haslhofer
George Katsogiannis- Meimarakis
Georgia Koutrika
Shengmin Jin
Danai Koutra
Reza Zafarani
Yulia Tsvetkov
Vidhisha Balachandran
Sachin Kumar
Xiangyu Zhao
Bo Chen
Huifeng Guo
Yejing Wang
Ruiming Tang
Yang Zhang
Wenjie Wang
Peng Wu
Fuli Feng
Xiangnan He
This paper summarizes the content of the 20 tutorials that have been given at The Web Conference 2022: 85% of these tutorials are lecture st… (voir plus)yle, and 15% of these are hands on.
2022-04-25
The Web Conference (publié)
doi.org
Offline Retrieval Evaluation Without Evaluation Metrics
Fernando Diaz
Andres Ferraro
Offline evaluation of information retrieval and recommendation has traditionally focused on distilling the quality of a ranking into a scala… (voir plus)r metric such as average precision or normalized discounted cumulative gain. We can use this metric to compare the performance of multiple systems for the same request. Although evaluation metrics provide a convenient summary of system performance, they also collapse subtle differences across users into a single number and can carry assumptions about user behavior and utility not supported across retrieval scenarios. We propose recall-paired preference (RPP), a metric-free evaluation method based on directly computing a preference between ranked lists. RPP simulates multiple user subpopulations per query and compares systems across these pseudo-populations. Our results across multiple search and recommendation tasks demonstrate that RPP substantially improves discriminative power while correlating well with existing metrics and being equally robust to incomplete data.
2022-04-25
ArXiv (preprint)
doi.org
arxiv.org
QEN: Applicable Taxonomy Completion via Evaluating Full Taxonomic Relations
Suyuchen Wang
Ruihui Zhao
Yefeng Zheng
Bang Liu
Taxonomy is a fundamental type of knowledge graph for a wide range of web applications like searching and recommendation systems. To keep a … (voir plus)taxonomy automatically updated with the latest concepts, the taxonomy completion task matches a pair of proper hypernym and hyponym in the original taxonomy with the new concept as its parent and child. Previous solutions utilize term embeddings as input and only evaluate the parent-child relations between the new concept and the hypernym-hyponym pair. Such methods ignore the important sibling relations, and are not applicable in reality since term embeddings are not available for the latest concepts. They also suffer from the relational noise of the “pseudo-leaf” node, which is a null node acting as a node’s hyponym to enable the new concept to be a leaf node. To tackle the above drawbacks, we propose the Quadruple Evaluation Network (QEN), a novel taxonomy completion framework that utilizes easily accessible term descriptions as input, and applies pretrained language model and code attention for accurate inference while reducing online computation. QEN evaluates both parent-child and sibling relations to both enhance the accuracy and reduce the noise brought by pseudo-leaf. Extensive experiments on three real-world datasets in different domains with different sizes and term description sources prove the effectiveness and robustness of QEN on overall performance and especially the performance for adding non-leaf nodes, which largely surpasses previous methods and achieves the new state-of-the-art of the task.1
2022-04-25
The Web Conference (publié)
doi.org
QEN: Applicable Taxonomy Completion via Evaluating Full Taxonomic Relations
Suyuchen Wang
Ruihui Zhao
Yefeng Zheng
Bang Liu
Taxonomy is a fundamental type of knowledge graph for a wide range of web applications like searching and recommendation systems. To keep a … (voir plus)taxonomy automatically updated with the latest concepts, the taxonomy completion task matches a pair of proper hypernym and hyponym in the original taxonomy with the new concept as its parent and child. Previous solutions utilize term embeddings as input and only evaluate the parent-child relations between the new concept and the hypernym-hyponym pair. Such methods ignore the important sibling relations, and are not applicable in reality since term embeddings are not available for the latest concepts. They also suffer from the relational noise of the “pseudo-leaf” node, which is a null node acting as a node’s hyponym to enable the new concept to be a leaf node. To tackle the above drawbacks, we propose the Quadruple Evaluation Network (QEN), a novel taxonomy completion framework that utilizes easily accessible term descriptions as input, and applies pretrained language model and code attention for accurate inference while reducing online computation. QEN evaluates both parent-child and sibling relations to both enhance the accuracy and reduce the noise brought by pseudo-leaf. Extensive experiments on three real-world datasets in different domains with different sizes and term description sources prove the effectiveness and robustness of QEN on overall performance and especially the performance for adding non-leaf nodes, which largely surpasses previous methods and achieves the new state-of-the-art of the task.1
2022-04-25
The Web Conference (published)
doi.org
Shared and unique brain network features predict cognitive, personality, and mental health scores in the ABCD study
Jianzhong Chen
Angela Tam
Valeria Kebets
Csaba Orban
L.Q.R. Ooi
Christopher L Asplund
Scott A. Marek
N. Dosenbach
Simon B. Eickhoff
Danilo Bzdok
Avram J. Holmes
B.T. Thomas Yeo
2022-04-25
Nature Communications (published)
doi.org
Shared and unique brain network features predict cognitive, personality, and mental health scores in the ABCD study
Jianzhong Chen
Angela Tam
Valeria Kebets
Csaba Orban
L.Q.R. Ooi
Leon Qi Rong Ooi
Christopher L. Asplund
Scott Marek
Nico Dosenbach
Simon B. Eickhoff
Danilo Bzdok
Avram J. Holmes
B.T. Thomas Yeo
2022-04-25
Nature Communications (publié)
doi.org
Staged independent learning: Towards decentralized cooperative multi-agent Reinforcement Learning
Hadi Nekoei
Akilesh Badrinaaraayanan
Amit Sinha
Mohammad Amini
Janarthanan Rajendran
Aditya Mahajan
Sarath Chandar Anbil Parthipan
We empirically show that classic ideas from two-time scale stochastic approximation \citep{borkar1997stochastic} can be combined with sequen… (voir plus)tial iterative best response (SIBR) to solve complex cooperative multi-agent reinforcement learning (MARL) problems. We first start with giving a multi-agent estimation problem as a motivating example where SIBR converges while parallel iterative best response (PIBR) does not. Then we present a general implementation of staged multi-agent RL algorithms based on SIBR and multi-time scale stochastic approximation, and show that our new methods which we call Staged Independent Proximal Policy Optimization (SIPPO) and Staged Independent Q-learning (SIQL) outperform state-of-the-art independent learning on almost all the tasks in the epymarl \citep{papoudakis2020benchmarking} benchmark. This can be seen as a first step towards more decentralized MARL methods based on SIBR and multi-time scale learning.
2022-04-25
ICLR.cc/2022/Workshop/GMS (publié)
openreview.net
openreview.net
VisPaD: Visualization and Pattern Discovery for Fighting Human Trafficking
Pratheeksha Nair
Yifei Li
Catalina Vajiac
Andreas Olligschlaeger
Meng-Chieh Lee
Namyong Park
Duen Horng Chau
Christos Faloutsos
Reihaneh Rabbany
Chieh Lee
Human trafficking analysts investigate groups of related online escort advertisements (called micro-clusters) to detect suspicious activitie… (voir plus)s and identify various modus operandi. This task is complex as it requires finding patterns and linked meta-data across micro-clusters such as the geographical spread of ads, cluster sizes, etc. Additionally, drawing insights from the data is challenging without visualizing these micro-clusters. To address this, in close-collaboration with domain experts, we built VisPaD, a novel interactive way for characterizing and visualizing micro-clusters and their associated meta-data, all in one place. VisPaD helps discover underlying patterns in the data by projecting micro-clusters in a lower dimensional space. It also allows the user to select micro-clusters involved in suspicious patterns and interactively examine them leading to faster detection and identification of trends in the data. A demo of VisPaD is also released1.
2022-04-25
The Web Conference (published)
doi.org
VisPaD: Visualization and Pattern Discovery for Fighting Human Trafficking
Pratheeksha Nair
Yifei Li
Catalina Vajiac
Andreas Olligschlaeger
Meng-Chieh Lee
Namyong Park
Duen Horng Chau
Christos Faloutsos
Reihaneh Rabbany
Chieh Lee
2022-04-25
The Web Conference (publié)
doi.org
Local Learning with Neuron Groups
Adeetya Patel
Michael Eickenberg
Eugene Belilovsky
2022-04-21
ICLR.cc/2022/Workshop/Cells2Societies (poster)
doi.org
openreview.net
Summarizing Societies: Agent Abstraction in Multi-Agent Reinforcement Learning
Amin Memarian
Maximilian Puelma Touzel
Matthew D Riemer
Rupali Bhati
Irina Rish
Agents cannot make sense of many-agent societies through direct consideration of small-scale, low-level agent identities, but instead must r… (voir plus)ecognize emergent collective identities. Here, we take a first step towards a framework for recognizing this structure in large groups of low-level agents so that they can be modeled as a much smaller number of high-level agents—a process that we call agent abstraction. We illustrate this process by extending bisimulation metrics for state abstraction in reinforcement learning to the setting of multi-agent reinforcement learning and analyze a straightforward, if crude, abstraction based on experienced joint actions. It addresses non-stationarity due to other learning agents by improving minimax regret by a intuitive factor. To test if this compression factor provides signal for higher-level agency, we applied it to a large dataset of human play of the popular social dilemma game Diplomacy. We find that it correlates strongly with the degree of ground-truth abstraction of low-level units into the human players.
2022-04-21
ICLR.cc/2022/Workshop/Cells2Societies (poster)
openreview.net
openreview.net