A locally-built, LLM-digested index of recent arXiv papers in quant finance, geometry/topology, and statistical ML — keyword search served straight from SQLite on this machine.
We accelerate Bayesian inference for neutrino physics experiments by 100-60x.
CNN improves neutrino event reconstruction in IceCube DeepCore.
Measuring supernova neutrinos removes spacetime's conformal freedom.
Machine learning boosts physics research, especially at high energy experiments.
Experiments in particle physics produce enormous quantities of data that must be analyzed and interpreted by teams of physicists. This analysis is often exploratory, where scientists are unable to enumerate the possible types of signal prior to performing the experiment. Thus, tools for summarizing, clustering, visuali…
This study uses deep learning to improve the accuracy of raw data denoising in ProtoDUNE experiments.
The unified approach of Feldman and Cousins allows for exact statistical inference of small signals that commonly arise in high energy physics. It has gained widespread use, for instance, in measurements of neutrino oscillation parameters in long-baseline experiments. However, the approach relies on the Neyman construc…
AI helps build particle physics theories more efficiently.
New method optimizes expensive simulations for complex systems.
Matter-antimatter asymmetry is one of the major unsolved problems in physics that can be probed through precision measurements of charge-parity symmetry violation at current and next-generation neutrino oscillation experiments. In this work, we demonstrate the capability of variational autoencoders and normalizing flow…
We present a deep learning approach for vertex reconstruction of neutrino-nucleus interaction events, a problem in the domain of high energy physics. In this approach, we combine both energy and timing data that are collected in the MINERvA detector to perform classification and regression tasks. We show that the resul…
In this paper we deal with quadratic metric-affine gravity, which we briefly introduce, explain and give historical and physical reasons for using this particular theory of gravity. Further, we introduce a generalisation of well known spacetimes, namely pp-waves. A classical pp-wave is a 4-dimensional Lorentzian spacet…
The success of Convolutional Neural Networks (CNNs) in image classification has prompted efforts to study their use for classifying image data obtained in Particle Physics experiments. Here, we discuss our efforts to apply CNNs to 2D and 3D image data from particle physics experiments to classify signal from background…
New magnetic memory effects found in gravitational waves and memory.
Deep learning for particle classification on large event images.
Machine learning has been applied to several problems in particle physics research, beginning with applications to high-level physics analysis in the 1990s and 2000s, followed by an explosion of applications in particle and event identification and reconstruction in the 2010s. In this document we discuss promising futu…
We suggest an alternative mathematical model for the massless neutrino. Consider an elastic continuum in 3-dimensional Euclidean space and assume that points of this continuum can experience no displacements, only rotations. This framework is a special case of the so-called Cosserat theory of elasticity. Rotations of p…
The paper deals with the Weyl equation which is the massless Dirac equation. We study the Weyl equation in the stationary setting, i.e. when the the spinor field oscillates harmonically in time. We suggest a new geometric interpretation of the stationary Weyl equation, one which does not require the use of spinors, Pau…
The main result of the paper is a new representation for the Weyl Lagrangian (massless Dirac Lagrangian). As the dynamical variable we use the coframe, i.e. an orthonormal tetrad of covector fields. We write down a simple Lagrangian - wedge product of axial torsion with a lightlike element of the coframe - and show tha…
Tasks involving the analysis of geometric (graph- and manifold-structured) data have recently gained prominence in the machine learning community, giving birth to a rapidly developing field of geometric deep learning. In this work, we leverage graph neural networks to improve signal detection in the IceCube neutrino ob…
In abstract Yang-Mills theory the standard instanton construction relies on the Hodge star having real eigenvalues which makes it inapplicable in the Lorentzian case. We show that for the affine connection an instanton-type construction can be carried out in the Lorentzian setting. The Lorentzian analogue of an instant…
Next-generation cosmic microwave background (CMB) experiments will have lower noise and therefore increased sensitivity, enabling improved constraints on fundamental physics parameters such as the sum of neutrino masses and the tensor-to-scalar ratio r. Achieving competitive constraints on these parameters requires hig…
Enhanced detection of sneutrinos at the LHC using machine learning.
We consider spacetime to be a connected real 4-manifold equipped with a Lorentzian metric and an affine connection. The 10 independent components of the (symmetric) metric tensor and the 64 connection coefficients are the unknowns of our theory. We introduce an action which is quadratic in curvature and study the resul…
A new method prioritizes and recycles experiences for better reinforcement learning.
This project combines recent advances in experience replay techniques, namely, Combined Experience Replay (CER), Prioritized Experience Replay (PER), and Hindsight Experience Replay (HER). We show the results of combinations of these techniques with DDPG and DQN methods. CER always adds the most recent experience to th…
ReaPER improves learning efficiency by prioritizing reliable experiences.
This paper describes an improvement in Deep Q-learning called Reverse Experience Replay (also RER) that solves the problem of sparse rewards and helps to deal with reward maximizing tasks by sampling transitions successively in reverse order. On tasks with enough experience for training and enough Experience Replay mem…
Unified model optimizes experiment performance and reduces duration.
An important component of many Deep Reinforcement Learning algorithms is the Experience Replay which serves as a storage mechanism or memory of made experiences. These experiences are used for training and help the agent to stably find the perfect trajectory through the problem space. The classic Experience Replay howe…
New method designs experiments robustly for nonlinear estimation, improving parameter knowledge.
Experience reuse is key to sample-efficient reinforcement learning. One of the critical issues is how the experience is represented and stored. Previously, the experience can be stored in the forms of features, individual models, and the average model, each lying at a different granularity. However, new tasks may requi…
Optimal tests developed for sequential experiments with asymptotic properties.
Bayesian optimization for long-term outcomes using fast and slow experiments.
Two methods estimate effect size for online experiments, improving accuracy and efficiency.
Experience replay enables reinforcement learning agents to memorize and reuse past experiences, just as humans replay memories for the situation at hand. Contemporary off-policy algorithms either replay past experiences uniformly or utilize a rule-based replay strategy, which may be sub-optimal. In this work, we consid…
Study finds real-world datasets contain natural experiments that can improve model performance.
We reduce variance in monetization metrics for ranking experiments.
New framework for choosing optimal proxy metrics from past experiments.
Experience replay is widely used in deep reinforcement learning algorithms and allows agents to remember and learn from experiences from the past. In an effort to learn more efficiently, researchers proposed prioritized experience replay (PER) which samples important transitions more frequently. In this paper, we propo…
LiDER refreshes past experiences in RL by dreaming about them.
We analyze the sample complexity of learning from multiple experiments where the experimenter has a total budget for obtaining samples. In this problem, the learner should choose a hypothesis that performs well with respect to multiple experiments, and their related data distributions. Each collected sample is associat…
The paper improves reinforcement learning stability and efficiency with a new theoretical framework.
Optimal adaptive experiment for choosing best treatment with binary outcomes.
We study the task of retrieving relevant experiments given a query experiment. By experiment, we mean a collection of measurements from a set of `covariates' and the associated `outcomes'. While similar experiments can be retrieved by comparing available `annotations', this approach ignores the valuable information ava…
Expands Bayesian experiment design framework to account for model discrepancies.
ER-GNN uses experience replay to prevent GNNs from forgetting previous tasks.
The paper addresses statistical inference issues in adaptive experiments.