Research
On-device research index

arXiv research

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.

169,341 papers · 148 categories

Trend · papers per month

90181271361 · Jun 202019922001200920182026
48 results for grid observability

This work improves grid observability using smart meter data.

problem Limited metering infrastructure leads to observability issues in distribution grids.
method Developed a coupled formulation of the power flow problem (CPF) and a coupled power system state estimation (CPSSE) problem to infer grid state.
result A necessary and sufficient criterion for local observability in radial networks was identified.

RNNs trained on spatial tasks develop grid-like spatial representations.

problem Understanding the neural code for spatial navigation in the brain.
method Training recurrent neural networks to perform spatial localization tasks.
result Grid-like spatial response patterns emerge in trained RNNs, similar to EC grid cells.

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.

Smart grid uses deep learning to optimize household energy use.

problem Optimizing household energy use under real-time pricing schemes.
method Multi-agent deep actor-critic learning for decentralized agents with partial observability.
result Deep reinforcement learning reduces peak-to-average energy consumption and costs.

Study on typical knots and links using grid diagrams, focusing on size, components, and writhe.

problem Understanding the statistical behavior of knots and links, especially their typical properties.
method Modeling knots and links with grid diagrams, examining three invariants: size, components, and writhe, through numerical analysis.
result The size of a random knot is uniformly distributed and linearly dependent on grid size, while the number of components follows a distribution whose mean and variance grow with log_2 of grid size.

Improved weather forecasting with gridded pseudo-token TNPs.

problem Handling large-scale, unstructured spatio-temporal data in weather forecasting.
method Introducing gridded pseudo-token transformer neural processes (TNPs) with efficient attention mechanisms.
result Consistently outperforms baselines on various synthetic and real-world regression tasks involving large-scale data.

The paper develops algorithms to accurately identify power grid topology.

problem Identifying the exact topology of a power grid in real-time.
method Graphical model framework for topology estimation using voltage measurements.
result Exact extraction of operational topology is theoretically guaranteed for grid topologies without three-node cycles.

Hexagon grid patterns emerge from conformal isometry in grid cell neural networks.

problem Understanding the algebraic, geometric, and topological properties of grid cells.
method Investigating recurrent neural network models of grid cells, focusing on Lie group and Lie algebra representations, conformal isometry, and hexagon periodic patterns.
result Conformal isometry leads to hexagon periodic patterns in grid cell responses and accurate path integration.

Study finds cherry-picking load shaping strategies outperforms others in reducing grid CO2 emissions.

problem Lack of detailed counterfactual data makes it hard to assess load shaping strategies' effectiveness.
method Calibrated granular ERCOT simulations for counterfactual analysis of load shaping strategies.
result LMP-based load shaping outperforms other strategies in reducing grid CO2 emissions.

Novel grid-based filters converge to optimal state estimation.

problem Recursive estimation of Markov processes in noisy conditions.
method Developed novel grid-based filters with relaxed conditions for convergence.
result Grid-based filters converge to the MMSE estimator under relaxed conditions.

The potential of recovering the topology of a grid using solely publicly available market data is explored here. In contemporary whole-sale electricity markets, real-time prices are typically determined by solving the network-constrained economic dispatch problem. Under a linear DC model, locational marginal prices (LM…

2013-12-02abs ↗pdf ↗

We explain how to compute the Jones polynomial of a link from one of its grid diagrams and we observe a connection between Bigelow's homological definition of the Jones polynomial and Kauffman's definition of the Jones polynomial. Consequently, we prove that the Maslov grading on the Seidel-Smith symplectic link invari…

2009-02-19abs ↗pdf ↗

EGPR method forecasts power grid load and generation with high accuracy.

problem Accurate week-long forecasting of load demand and power generation for efficient power grid operation.
method Gaussian process regression with ensembles of preceding weeks' data.
result EGPR method outperforms traditional methods in forecasting weekly load and generation.

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.

The paper proposes a method to identify latent factors from sampled and fired graph data.

problem Identifying latent factors from sampled and fired graph data.
method The paper presents a theoretical and practical approach to build an identifier of latent factor activations.
result The method successfully identifies latent factor activations from sampled and fired graph data.

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…

2013-03-07abs ↗pdf ↗

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.

New test determines appropriate number of biclusters in relational data.

problem Determining the correct number of biclusters in relational data matrices.
method Proposes a new statistical test that does not require regular-grid assumptions.
result Derives asymptotic behavior of the test statistic for both null and alternative cases.

A fast method for pricing various financial options.

problem Efficient pricing of discretely monitored early-exercise options.
method A quadrature technique-based method using elementary calculations and a fixed grid.
result Convergence rate of O(1/N4)O(1/N^4) and complexity of O(MNlogN)O(MN\log N).

CNN improves fault location in power grids with high accuracy.

problem Challenges in real-time fault location due to diverse fault types and fast reclosures.
method Convolutional Neural Network (CNN) classifier using bus voltages.
result CNN-based localization tool outperforms other machine learning methods.

SPACY discovers causal graphs from spatiotemporal data using variational inference.

problem Inferring causal relationships from high-dimensional spatiotemporal data with complex correlations.
method SPACY uses variational inference to model latent time series and their causal relationships, incorporating spatial factors to aggregate correlated data.
result SPACY outperforms state-of-the-art methods on synthetic and real-world data, identifying key causal phenomena.

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\mathbb{CP}^2 under certain conditions.

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.

Combines pseudo-point and state space approximations for scalable GPs.

problem Handling large numbers of off-the-grid spatial data-points and long time-series.
method Combines pseudo-point approximations for spatial data with state space GP approximations for temporal data.
result Combined approach is more scalable and applicable to a greater range of spatio-temporal problems.

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.

Designing probing injections for smart inverters to infer non-metered loads.

problem Inferring non-metered loads from electric grid probing.
method Designing probing injections that adhere to inverter and network constraints, using a library of candidate vectors and SDP relaxation for noisy data.
result Improved load estimates through optimal probing design.

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.