New trading strategy beats traditional grid in crypto markets.
problem Low expected return of traditional grid trading strategy.
method Dynamic Grid Trading (DGT) strategy that adapts to market conditions.
result DGT strategy outperforms traditional grid and buy-and-hold strategies.
GraPhyR uses GNNs to optimize power grid reconfiguration in real-time.
problem Optimizing power grid reconfiguration for reliability and efficiency.
method Physics-informed Graph Neural Network (GNN) framework.
result GraPhyR learns to optimize DyR tasks efficiently.
Neural network HDP improves virtual inertia control for non-inductive grids.
problem Traditional virtual inertia controllers are not suitable for non-inductive grids.
method Adaptive neural network heuristic dynamic programming (HDP) for optimal control.
result The proposed HDP controller outperforms traditional controllers in virtual inertia control.
Reconstructs power grid dynamics from PMU measurements.
problem Reconstructing dynamic state matrix of power transmission grids.
method Maximum likelihood based convex estimators adapting to prior information.
result Fully data-driven method that works in near real-time.
Survey of RL methods for optimizing power grid topologies.
problem Optimizing power grid operation with adaptive control strategies.
method Reinforcement Learning (RL) for dynamic and uncertain environments.
result Comprehensive evaluation of RL-based methods for power grid topology optimization.
Efficiently prices American options with multiple assets using sparse grids.
problem Pricing American options with multiple underlying assets efficiently.
method Dynamic programming formulation followed by sparse grid interpolation.
result Sparse grids reduce the number of interpolation points and maintain function smoothness.
We consider the dynamics of a smart grid system characterized by widespread distributed generation and storage devices. We assume that agents are free to trade electric energy over the network and we focus on the emerging market dynamics. We consider three different models for the market dynamics for which we present a…
Framework detects anomalies in real-time PMU data.
problem Anomaly detection in power grid operations.
method Statistical learning and dynamical model.
result Effective anomaly detection and classification.
PhI-GPR improves power grid state estimation and forecasting.
problem Accurate state estimation and forecasting in power grids with sparse measurements.
method Physics-informed Gaussian process regression (PhI-GPR) for stochastic differential equations.
result PhI-GPR provides more accurate forecasts and estimates of power grid states compared to ARIMA.
The topology of a power grid affects its dynamic operation and settlement in the electricity market. Real-time topology identification can enable faster control action following an emergency scenario like failure of a line. This article discusses a graphical model framework for topology estimation in bulk power grids (…
New method segments power grids in real time for easier control.
problem Segmenting large-scale power grids for real-time control.
method Guided machine learning approach with Influence Graph and community detection.
result Promising and original interpretable results on various grids.
PNDEs project neural dynamics onto constraint manifolds, improving accuracy and stability.
problem Learning dynamics from data without violating known constraints.
method Projecting the learned vector field onto the tangent space of the constraint manifold.
result PNDEs outperform existing methods in learning constrained dynamical systems.
Sparse grid method improves risk measurement for financial and insurance companies.
problem Measuring risk in financial and insurance balance sheets.
method Sparse grid approximation for numerical estimation of loss distribution.
result Sparse grid approach is more efficient and competitive for models with moderate dimension.
A predictor improves power grid frequency forecasts up to one hour.
problem Improving frequency forecast for better power system stability.
method Developed a weighted-nearest-neighbor (WNN) predictor.
result Forecasts for up to one hour are more precise than averaged daily profiles.
AI model enhances grid monitoring with synchro-waveform tech.
problem Dynamic, stochastic, low-inertia future grids need advanced monitoring.
method AI Foundation Model with synchro-waveform tech.
result Significantly improved fault detection accuracy and speed.
Improved tracking of tangled point sources using Riemannian metrics.
problem Tangled point source trajectories in temporal stacks.
method Lifting to higher-dimensional space of roto-translation group, new regularisation based on relaxed Reeds-Shepp metric.
result Reconstruction and untangling of trajectories even from numerical standpoint.
Paper develops a fast method to find near-optimal power solutions.
problem Solving AC OPF on fast timescales for large networks.
method Leverages machine learning to map system loading to optimal generation values.
result Near-optimal and feasible solutions found on milliseconds timescales.
A new approach models exploration in continuous-time RL using random measures.
problem Modeling exploration in continuous-time reinforcement learning.
method Random measure approach to control execution in continuous-time RL.
result Grid-sampling limit SDE can replace existing models for theoretical analysis and learning algorithms.
Prototype for early fault warnings in large electric grids.
problem Early detection and classification of faults in complex electric grids.
method Multi-stage approach with anomaly detection, feature mapping, classification, and clustering.
result Random forest method offers the most accurate fault classification.
DINo forecasts PDEs with flexible extrapolation and adaptability.
problem Fixed discretizations limit real-world PDE forecasting.
method DINo uses implicit neural representations for continuous-time dynamics.
result DINo outperforms other neural PDE forecasters.
Model predicts urban population using mobile data traffic.
problem Estimating urban population dynamics from mobile data.
method Data-driven approach combining NetMob 2023 and ENACT datasets.
result NetMob 2023 data can estimate urban population with XGBoost models.
M-CaStLe discovers causal structures in multivariate space-time data.
problem Challenges in causal graph discovery for high-dimensional gridded data.
method Generalizes CaStLe to multivariate analyses, using local embeddings and pooling spatial replicates.
result More accurately recovers multivariate causal structure and identifies physical dynamics.
Graph neural networks learn PDEs from sparse, irregular data.
problem Learning PDEs from irregularly spaced data.
method Continuous-time differential model with graph neural networks for arbitrary discretizations.
result Efficient inference with continuous-time adjoint method.
Deep learning improves climate models by capturing sub-grid processes efficiently.
problem Uncertainty in climate models due to sub-grid processes, especially clouds.
method Trained a deep neural network to represent atmospheric sub-grid processes in a climate model.
result The neural network accurately reproduces climate and variability features from a cloud-resolving model.
SDIFT generates full-field dynamics from sparse, irregular data.
problem Modeling and reconstructing physical dynamics from sparse, off-grid observations.
method SDIFT uses a functional Tucker model and sequential diffusion for generating full-field evolution from irregular sparse observations.
result Significant improvements in reconstruction accuracy and computational efficiency compared to state-of-the-art approaches.
We present a grid diagram analogue of Carter, Rieger and Saito's smooth movie theorem. Specifically, we give definitions for grid movies, grid movie isotopies and present a definition of grid planar isotopy as a particular subset of the grid diagram moves: stabilization, destabilization and commutation. We show that gr…
PowRL uses RL to manage power grids robustly, reducing overloads and maintaining power reliability.
problem Managing transient stability and preventing blackouts in power networks with uncertain generation and load demands.
method PowRL leverages a novel heuristic for overload management and RL-guided topology selection to ensure safe and reliable operation.
result PowRL outperforms other agents in L2RPN challenges, demonstrating robust performance in various scenarios.
Project develops lip reading algorithm for limited English.
problem Limited audio information for lip reading.
method Extract lip positions from video frames, classify visemes and phonemes, use HMMs to predict words.
result Algorithm predicts words from lip movements for a subset of English.
Optimal sampling reduces power grid data analysis costs.
problem Efficient online analysis of high-speed, correlated IoT data.
method D-optimality criterion-based sampling methods combining Bernoulli and leverage score sampling.
result Leverage score sampling improves computational efficiency and outperforms benchmarks.
A reinforcement learning method selects the best short-term load forecasting model.
problem Challenges in selecting the best short-term load forecasting model under varying conditions.
method A Q-learning agent learns the optimal policy of selecting the best forecasting model for the next time step.
result The Q-learning algorithm converges fast and improves forecasting accuracy by approximately 50%.
The paper introduces triple grid diagrams to construct Lagrangian surfaces in complex projective space.
problem Constructing Lagrangian surfaces in complex projective space.
method Defining and analyzing triple grid diagrams to determine Lagrangian caps and surfaces.
result Triple grid diagrams can determine closed Lagrangian surfaces in CP2 under certain conditions. Bayesian method improves grid admittance matrix estimation from noisy data.
problem Accurate estimation of power grid admittance matrix in dynamic systems.
method Data-driven identification using voltage and current measurements, Bayesian approach.
result Significantly greater accuracy in admittance matrix estimation compared to existing methods.
Transformer model for probabilistic dynamical systems.
problem Modeling high-dimensional dynamical systems from noisy observations.
method Parallel between dynamical systems and language modeling; transformer-based model with geometrical properties; iterative training algorithm.
result Fine-grid approximation of conditional probabilities for high-dimensional systems.
In the present work we introduce a stochastic cellular automata model in order to simulate the dynamics of the stock market. A direct percolation method is used to create a hierarchy of clusters of active traders on a two dimensional grid. Active traders are characterised by the decision to buy, (+1), or sell, (-1), a …
Half grid diagrams prove every link can be represented by a special type of grid diagram.
problem Representing links using grid diagrams and related invariants.
method Defining half grid diagrams and constructing canonical pairs, proving equivalence to Jones' construction, relating to classical link invariants.
result Established a new method to relate the oriented Thompson index to classical link invariants and provided bounds for knot invariants.
Grid homology confirms the Upsilon invariant in knot theory.
problem Verifying the equivalence of Upsilon invariants in knot theory.
method Reconstructed Upsilon invariant using grid homology and proved equivalence.
result Upsilon invariants in knot Floer and grid homology are equivalent.
GridPyM handles grid diagrams for knot theory.
problem Handling grid diagrams for knot theory.
method Generates and simplifies grids, models local transformations.
result Models local transformations between grid diagrams.
Poisson CNN solves Poisson equations on Cartesian grids efficiently.
problem Solving Poisson equations on 2D Cartesian grids with various boundary conditions.
method Fully convolutional neural network (CNN) architecture to solve Poisson equation.
result Encouraging performance in predicting Poisson solutions with mean errors below 10%.
Modeling intraday dispatch for wind-battery assets to meet grid targets.
problem Meeting grid targets for wind-battery assets in an intraday context.
method Developed a mathematical model with closed-form solutions and a novel algorithm for stochastic control.
result Calibrated model to 140+ wind-battery assets in Texas, demonstrating economic benefits.
Grid homology theory for spatial graphs extends skein sequence.
problem No specific problem stated; focuses on extending a sequence.
method Defined grid homology theory for spatial graphs and extended skein sequence.
result Skein exact sequence extended to grid homology for spatial graphs.
Continuous-time optimal stopping solved with deep reinforcement learning
problem Optimal stopping problems in continuous time
method CARLOS (Continuous-time Adaptive Reinforcement Learning for Optimal Stopping)
result Higher prices than existing Bermudan solvers, approaching American upper bound
New probabilistic graph models for efficient power system simulation.
problem Complexity of modern power grids and challenges in physics-based models.
method Data-driven probabilistic graphs with custom non-linear models.
result Accurate and scalable models for large-scale power systems.
New method finds grid diagrams for many fibered knots.
problem Detecting fibered knots using grid diagrams.
method Developed an efficient method to identify grid diagrams with unique maximal Alexander grading states.
result Found suitable grid diagrams for 5385 of 5397 fibered prime knots with crossing number ≤ 13.
Extends knot invariant to filtered grid complexes.
problem Knot invariants and grid complexes.
method Combining Ozsváth-Szabó-Stipsicz crossing-change maps with Alishahi-Eftekhary l(K) invariant.
result Combinatorial formulation of knot invariant.
Grid homology properties for MOY graphs studied.
problem Defining and studying properties of grid homology for MOY graphs.
method Defined grid homology from Harvey and O'Donnol's work. Studied properties using oriented skein relation, edge contraction, and parallel edge unification.
result Properties of grid homology for MOY graphs were studied and defined.
Paper proposes a new method for predicting DER adoption with hierarchical guarantees.
problem Accurately predicting DER adoption in electric grids with uncertainty and spatial disparity.
method Multivariate Hawkes process for modeling DER adoption dynamics and split conformal prediction algorithm for hierarchical validity.
result Empirical evaluation shows superior predictive accuracy and uncertainty calibration compared to existing methods.
Grid homology invariant proved for lens space links.
problem Proving combinatorial invariance of grid homology for lens space links.
method Combining combinatorial methods with sign assignments to prove invariance.
result Grid homology is a link invariant for lens space links.
New method constructs moduli spaces of Lagrangian surfaces in CP^2 from grid diagrams.
problem Constructing explicit examples of triple grid diagrams for Lagrangian surfaces in CP^2.
method Elegant geometric construction reducing to linear algebra.
result Explicit construction of moduli space of triple grid diagrams.