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.

168,694 papers · 148 categories

Trend · papers per month

91182272363 · Jun 202019922001200920172026
48 results for variable grid nodes

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 (…

2017-07-05abs ↗pdf ↗

Node2Grids uncouples GCN training for large graphs, saving memory and computation.

problem GCNs' coupled training framework limits flexibility and scalability for large-scale graphs.
method Node2Grids maps coupled graph data into independent grid-like data for efficient processing.
result Node2Grids achieves comparable results to GCNs while saving memory and computation.

Extends geostatistical simulation method to handle multiple variables and large grids.

problem Scalability and handling of multiple variables in geostatistical simulation.
method Uses Sinkhorn optimal transport with sparse matcher and FFT-MA Gaussian backbone.
result MST-Direct reproduces joint distribution with zero histogram error and accurately preserves spatial correlation.

Graph-based state representation improves deep RL performance.

problem High sample-complexity and starting with a good input representation in deep RL.
method Exploiting the graph structure of MDPs for effective state representation learning.
result Graph-based node representation methods outperform matrix-based methods in grid-world navigation tasks.

The architectures of deep neural networks (DNN) rely heavily on the underlying grid structure of variables, for instance, the lattice of pixels in an image. For general high dimensional data with variables not associated with a grid, the multi-layer perceptron and deep belief network are often used. However, it is freq…

2019-12-07abs ↗pdf ↗

The increasing complexity of the power grid, due to higher penetration of distributed resources and the growing availability of interconnected, distributed metering devices re- quires novel tools for providing a unified and consistent view of the system. A computational framework for power systems data fusion, based on…

2017-05-24abs ↗pdf ↗

Power system studies require the topological structures of real-world power networks; however, such data is confidential due to important security concerns. Thus, power grid synthesis (PGS), i.e., creating realistic power grids that imitate actual power networks, has gained significant attention. In this letter, we cas…

2019-01-17abs ↗pdf ↗

A simpler edge-based discretization method without dual volumes.

problem Efficiently computing edge-based discretization vectors without forming dual volumes.
method Directly compute edge-midpoint vectors and reduce dual volume formation.
result Significant reduction in computing time for tetrahedral grids.

The paper examines linking numbers in grid models and finds polynomial moments.

problem Analyzing linking numbers in grid models.
method Examined linking numbers as a random variable on isotopy classes of 2-component links, computed moments and limits.
result The uuth moment of the linking number is a polynomial in the grid size with degree dud\leq u, and all odd moments vanish.

We suggest a novel method of clustering and exploratory analysis of temporal event sequences data (also known as categorical time series) based on three-dimensional data grid models. A data set of temporal event sequences can be represented as a data set of three-dimensional points, each point is defined by three varia…

2015-05-06abs ↗pdf ↗

The increasing penetration of distributed energy resources poses numerous reliability issues to the urban distribution grid. The topology estimation is a critical step to ensure the robustness of distribution grid operation. However, the bus connectivity and grid topology estimation are usually hard in distribution gri…

2016-11-06abs ↗pdf ↗

Statistical depth metrics help identify risky power grid scenarios.

problem Identifying extreme scenarios for risk mitigation in power grid planning.
method Functional depth metrics for sub-selecting outlying scenarios.
result The proposed approach effectively identifies risky scenarios for operational risk mitigation.

Bayesian deep learning improves geostatistical mapping with auxiliary data.

problem Traditional geostatistical methods are limited in feature learning and uncertainty estimation.
method Deep neural networks learn complex relationships from auxiliary data for probabilistic mapping.
result Deep learning produces detailed, probabilistic maps with uncertainty estimates.

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.

RBMs model binary interactions with hidden node activation effects.

problem Understanding how RBM hidden node activation affects binary variable distributions.
method Investigated RBM marginal distributions with different hidden node activation functions.
result Found exact expressions for RBM marginals as interacting binary variables.

New method identifies causal variables from multi-node interventions, expanding on previous single-node approaches.

problem Inferring high-level causal variables from low-level observations under multiple interventions.
method Exploits variance trace of ground truth causal variables and regularizes for sparsity.
result First identifiability result for causal representation learning with multiple node interventions.

Due to limited metering infrastructure, distribution grids are currently challenged by observability issues. On the other hand, smart meter data, including local voltage magnitudes and power injections, are communicated to the utility operator from grid buses with renewable generation and demand-response programs. This…

2016-12-20abs ↗pdf ↗

Improved covariate shift handling with node-based Bayesian neural networks.

problem Improving generalization under covariate shift in neural networks.
method Introduced node-based Bayesian neural networks that learn latent noise variables to represent input corruptions.
result Node-based BNNs perform well under covariate shift due to input perturbations, improving uncertainty estimation and robustness.

Machine learning predicts CO2 emissions in power grids, reducing uncertainty.

problem Forecasting CO2 emission intensities in power grids.
method Developed a machine learning algorithm using LASSO, feature selection, and Softmax weighted average.
result Marginal emissions are independent of DK2 zone conditions, suggesting external generators.

A standard technique for understanding underlying dependency structures among a set of variables posits a shared conditional probability distribution for the variables measured on individuals within a group. This approach is often referred to as module networks, where individuals are represented by nodes in a network, …

2014-05-11abs ↗pdf ↗

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.

Convolutional neural networks (CNNs) have achieved great success on grid-like data such as images, but face tremendous challenges in learning from more generic data such as graphs. In CNNs, the trainable local filters enable the automatic extraction of high-level features. The computation with filters requires a fixed …

2018-08-12abs ↗pdf ↗

We propose a new static parameterization of the implied volatility surface which is constructed by using polynomials of sigmoid functions combined with some other terms. This parameterization is flexible enough to fit market implied volatilities which demonstrate smile or skew. An arbitrage-free calibration algorithm i…

2014-07-01abs ↗pdf ↗

Unified quadrature framework for large-scale kernel machines.

problem Efficiently approximating kernel functions for large-scale machine learning.
method Deterministic and randomized interpolatory rules for numerical integration of kernel functions.
result The proposed method reduces the number of nodes needed for accurate kernel approximation.

We present a new family of zero-field Ising models over NN binary variables/spins obtained by consecutive "gluing" of planar and O(1)O(1)-sized components and subsets of at most three vertices into a tree. The polynomial-time algorithm of the dynamic programming type for solving exact inference (computing partition func…

2019-10-22abs ↗pdf ↗

New method smooths integrands for efficient option pricing.

problem Improving numerical performance of option pricing methods.
method Combining hierarchical adaptive sparse grids, quasi-Monte Carlo, and numerical smoothing.
result Improved efficiency of ASGQ and QMC methods for high-dimensional problems.

Traditionally, most complex intelligence architectures are extremely non-convex, which could not be well performed by convex optimization. However, this paper decomposes complex structures into three types of nodes: operators, algorithms and functions. Iteratively, propagating from node to node along edge, we prove tha…

2018-01-09abs ↗pdf ↗

Anytime MiniBatch speeds up online distributed optimization by handling slow nodes.

problem Mitigating the impact of slow nodes (stragglers) in distributed optimization.
method Proposes an online distributed optimization method that averages minibatch gradients via consensus rounds.
result Prevents stragglers from slowing progress without wasting work.

Bayesian method models binary response and covariates for two groups, estimating causal relationships.

problem Estimating causal relationships between binary response and covariates in observational data.
method Gaussian DAG-probit model with MCMC sampling for posterior distribution estimation.
result Validated method on simulated and real datasets, showing value of grouping variable in causality.

DAG models with hidden variables present many difficulties that are not present when all nodes are observed. In particular, fully observed DAG models are identified and correspond to well-defined sets ofdistributions, whereas this is not true if nodes are unobserved. Inthis paper we characterize exactly the set of dist…

2013-01-10abs ↗pdf ↗

Enhances inference of spreading processes using neural-network priors.

problem Estimating initial states of graph processes from partial observations.
method Bayesian framework with single-layer perceptron neural network for initial states; hybrid BP-AMP algorithm.
result Model exhibits first-order phase transitions, creating a statistical-to-computational gap.

New insights into data geometry reveal manifold structure in grid-cell activity.

problem Understanding the roles of different dimensions in data geometry.
method Generalised Hanson-Wright inequality and random function model analysis.
result Persistence diagrams reveal latent homology and manifold structure.

GATs improve node regression on noisy graphs with provable advantage.

problem Improving node regression on graphs with noisy covariates and edges.
method Proposes a GAT designed for denoising proxy features in node regression.
result GAT achieves lower error in estimating regression coefficient and predicting responses.

Study identifies latent variables and causal relationships from multiple environments.

problem Identify latent variables and causal relationships from multiple environments.
method Proposes algorithm LiNGCReL for identifying causal graph up to surrounded-node ambiguity.
result Identifies latent variables up to surrounded-node ambiguity (SNA) in linear causal models.