3 citations · 6 across the 8 of their papers we have counts for
8 papers
Graph is all you need? Lightweight data-agnostic neural architecture search without training
Zhenhan Huang, Tejaswini Pedapati, Pin-Yu Chen +2
Neural architecture search (NAS) enables the automatic design of neural network models. However, training the candidates generated by the search algorithm for performance evaluatio…
Neural Capacitance: A New Perspective of Neural Network Selection via Edge Dynamics
Chunheng Jiang, Tejaswini Pedapati, Pin-Yu Chen +2
Efficient model selection for identifying a suitable pre-trained neural network to a downstream task is a fundamental yet challenging task in deep learning. Current practice requir…
Network Graph Based Neural Architecture Search
Zhenhan Huang, Chunheng Jiang, Pin-Yu Chen +1
Neural architecture search enables automation of architecture design. Despite its success, it is computationally costly and does not provide an insight on how to design a desirable…
Environment Transfer for Distributed Systems
Chunheng Jiang, Jae-wook Ahn, Nirmit Desai
Collecting sufficient amount of data that can represent various acoustic environmental attributes is a critical problem for distributed acoustic machine learning. Several audio dat…
Heuristic assessment of the economic effects of pandemic control
Xiang Niu, Christopher Brissette, Chunheng Jiang +3
Data-driven risk networks describe many complex system dynamics arising in fields such as epidemiology and ecology. They lack explicit dynamics and have multiple sources of cost, b…
True Nonlinear Dynamics from Incomplete Networks
Chunheng Jiang, Jianxi Gao, Malik Magdon-Ismail
We study nonlinear dynamics on complex networks. Each vertex has a state which evolves according to a networked dynamics to a steady-state . We develop fundamental…
Practical Algorithms for Multi-Stage Voting Rules with Parallel Universes Tiebreaking
Jun Wang, Sujoy Sikdar, Tyler Shepherd +3
STV and ranked pairs (RP) are two well-studied voting rules for group decision-making. They proceed in multiple rounds, and are affected by how ties are broken in each round. Howev…
Practical Algorithms for STV and Ranked Pairs with Parallel Universes Tiebreaking
Jun Wang, Sujoy Sikdar, Tyler Shepherd +3
STV and ranked pairs (RP) are two well-studied voting rules for group decision-making. They proceed in multiple rounds, and are affected by how ties are broken in each round. Howev…