Gao, Y.
Artificial Intelligence for the Electron Ion Collider (AI4EIC)
Allaire, C., Ammendola, R., Aschenauer, E. -C., Balandat, M., Battaglieri, M., Bernauer, J., Bondì, M., Branson, N., Britton, T., Butter, A., Chahrour, I., Chatagnon, P., Cisbani, E., Cline, E. W., Dash, S., Dean, C., Deconinck, W., Deshpande, A., Diefenthaler, M., Ent, R., Fanelli, C., Finger, M., Finger,, M. Jr., Fol, E., Furletov, S., Gao, Y., Giroux, J., Waduge, N. C. Gunawardhana, Harish, R., Hassan, O., Hegde, P. L., Hernández-Pinto, R. J., Blin, A. Hiller, Horn, T., Huang, J., Jayakodige, D., Joo, B., Junaid, M., Karande, P., Kriesten, B., Elayavalli, R. Kunnawalkam, Lin, M., Liu, F., Liuti, S., Matousek, G., McEneaney, M., McSpadden, D., Menzo, T., Miceli, T., Mikuni, V., Montgomery, R., Nachman, B., Nair, R. R., Niestroy, J., Oregon, S. A. Ochoa, Oleniacz, J., Osborn, J. D., Paudel, C., Pecar, C., Peng, C., Perdue, G. N., Phelps, W., Purschke, M. L., Rajput, K., Ren, Y., Renteria-Estrada, D. F., Richford, D., Roy, B. J., Roy, D., Sato, N., Satogata, T., Sborlini, G., Schram, M., Shih, D., Singh, J., Singh, R., Siodmok, A., Stone, P., Stevens, J., Suarez, L., Suresh, K., Tawfik, A. -N., Acosta, F. Torales, Tran, N., Trotta, R., Twagirayezu, F. J., Tyson, R., Volkova, S., Vossen, A., Walter, E., Whiteson, D., Williams, M., Wu, S., Zachariou, N., Zurita, P.
The Electron-Ion Collider (EIC), a state-of-the-art facility for studying the strong force, is expected to begin commissioning its first experiments in 2028. This is an opportune time for artificial intelligence (AI) to be included from the start at this facility and in all phases that lead up to the experiments. The second annual workshop organized by the AI4EIC working group, which recently took place, centered on exploring all current and prospective application areas of AI for the EIC. This workshop is not only beneficial for the EIC, but also provides valuable insights for the newly established ePIC collaboration at EIC. This paper summarizes the different activities and R&D projects covered across the sessions of the workshop and provides an overview of the goals, approaches and strategies regarding AI/ML in the EIC community, as well as cutting-edge techniques currently studied in other experiments.
Consistency and Random Constraint Satisfaction Models
Culberson, J., Gao, Y.
In this paper, we study the possibility of designing non-trivial random CSP models by exploiting the intrinsic connection between structures and typical-case hardness. We show that constraint consistency, a notion that has been developed to improve the efficiency of CSP algorithms, is in fact the key to the design of random CSP models that have interesting phase transition behavior and guaranteed exponential resolution complexity without putting much restriction on the parameter of constraint tightness or the domain size of the problem. We propose a very flexible framework for constructing problem instances withinteresting behavior and develop a variety of concrete methods to construct specific random CSP models that enforce different levels of constraint consistency. A series of experimental studies with interesting observations are carried out to illustrate the effectiveness of introducing structural elements in random instances, to verify the robustness of our proposal, and to investigate features of some specific models based on our framework that are highly related to the behavior of backtracking search algorithms.
An Analysis of Phase Transition in NK Landscapes
Culberson, J., Gao, Y.
In this paper, we analyze the decision version of the NK landscape model from the perspective of threshold phenomena and phase transitions under two random distributions, the uniform probability model and the fixed ratio model. For the uniform probability model, we prove that the phase transition is easy in the sense that there is a polynomial algorithm that can solve a random instance of the problem with the probability asymptotic to 1 as the problem size tends to infinity. For the fixed ratio model, we establish several upper bounds for the solubility threshold, and prove that random instances with parameters above these upper bounds can be solved polynomially. This, together with our empirical study for random instances generated below and in the phase transition region, suggests that the phase transition of the fixed ratio model is also easy.
Neural Decoding of Cursor Motion Using a Kalman Filter
Wu, W, Black, M. J., Gao, Y., Serruya, M., Shaikhouni, A., Donoghue, J. P., Bienenstock, Elie
The direct neural control of external devices such as computer displays or prosthetic limbs requires the accurate decoding of neural activity representing continuousmovement. We develop a real-time control system using the spiking activity of approximately 40 neurons recorded with an electrode array implanted in the arm area of primary motor cortex. In contrast to previous work, we develop a control-theoretic approach that explicitly models the motion of the hand and the probabilistic relationship betweenthis motion and the mean firing rates of the cells in 70§ bins. We focus on a realistic cursor control task in which the subject mustmove a cursor to "hit" randomly placed targets on a computer monitor. Encoding and decoding of the neural data is achieved with a Kalman filter which has a number of advantages over previous linear filtering techniques. In particular, the Kalman filter reconstructions of hand trajectories in off-line experiments are more accurate than previously reportedresults and the model provides insights into the nature of the neural coding of movement.
Neural Decoding of Cursor Motion Using a Kalman Filter
Wu, W, Black, M. J., Gao, Y., Serruya, M., Shaikhouni, A., Donoghue, J. P., Bienenstock, Elie
The direct neural control of external devices such as computer displays or prosthetic limbs requires the accurate decoding of neural activity representing continuous movement. We develop a real-time control system using the spiking activity of approximately 40 neurons recorded with an electrode array implanted in the arm area of primary motor cortex.
An Analysis of Phase Transition in NK Landscapes
Gao, Y., Culberson, J.
In this paper, we analyze the decision version of the NK landscape model from the perspective of threshold phenomena and phase transitions under two random distributions, the uniform probability model and the fixed ratio model. For the uniform probability model, we prove that the phase transition is easy in the sense that there is a polynomial algorithm that can solve a random instance of the problem with the probability asymptotic to 1 as the problem size tends to infinity. For the fixed ratio model, we establish several upper bounds for the solubility threshold, and prove that random instances with parameters above these upper bounds can be solved polynomially. This, together with our empirical study for random instances generated below and in the phase transition region, suggests that the phase transition of the fixed ratio model is also easy.