FuDGE estimates differences between functional graphs in high-dimensional settings.
problem Estimating differences between two undirected functional graphical models with shared structures.
method FuDGE: A method that directly estimates the functional differential graph without first estimating individual graphs.
result FuDGE consistently estimates the functional differential graph in high-dimensional settings.
We derive a gradient estimate for positive functions, in particular for positive solutions to the heat equation, on finite or locally finite graphs. Unlike the well known Li-Yau estimate, which is based on the maximum principle, our estimate follows from the graph structure of the gradient form and the Laplacian operat…
Storchastic improves stochastic AD for complex models in RL and VI.
problem Handling intractable expectations in RL and VI.
method Introduces Storchastic, a framework for AD of stochastic computation graphs with various gradient estimation methods.
result Provable unbiasedness and variance reduction for higher-order gradients.
Paper analyzes multi-attribute data to estimate differences in Gaussian graphical models.
problem Estimating differences in two Gaussian graphical models with similar structure.
method Group lasso penalized D-trace loss function and ADMM algorithm for optimization.
result Consistency in support recovery and estimation in high-dimensional settings established.
Paper estimates differences in conditional independence graphs from time-dependent data.
problem Estimating changes in conditional dependencies between two time series with known similar structure.
method Penalized D-trace loss function approach in the frequency domain, using Wirtinger calculus, with convex and non-convex penalties.
result Established sufficient conditions for consistency and graph recovery in high-dimensional settings.
SPOT improves differentiable causal discovery by estimating skeleton posterior for latent confounders.
problem Scalable and accurate estimation of causal skeletons in the presence of latent confounders.
method SPOT (Skeleton Posterior-guided OpTimization) framework that estimates skeleton posterior and integrates it with differentiable causal discovery.
result SPOT enhances differentiable causal discovery by reducing the search space and improving accuracy.
Paper estimates differences in multi-attribute Gaussian graphical models using non-convex penalties.
problem Estimating differences in multi-attribute Gaussian graphical models with similar structure.
method Penalized D-trace loss function with non-convex (log-sum and SCAD) penalties, proximal gradient descent methods.
result Theoretical analysis and numerical examples support consistency in support recovery and estimation.
We develop a general framework on Dirichlet spaces to prove a weak form of the Bakry-Émery estimate and study its consequences. This estimate may be satisfied in situations, like metric graphs, where generalized notions of Ricci curvature lower bounds are not available.
New method denoises graph signals using wavelets, scalable for large graphs.
problem Denoising graph signals with overcomplete tight frames and correlated noise.
method Data-driven wavelet tight frame, Stein's unbiased risk estimate, Chebyshev-Jackson polynomial approximations, Monte-Carlo strategy.
result Method scales to large graphs and finds applications in differential privacy.
We generalize stochastic smoothing for gradient estimation of non-differentiable functions.
problem Gradient estimation for non-differentiable functions.
method Developed a general framework for relaxation and gradient estimation of non-differentiable black-box functions using stochastic smoothing with reduced assumptions.
result Empirically validated the effectiveness of variance reduction strategies for various non-differentiable tasks.
Proposes SDE framework for uncertainty quantification in graph neural networks.
problem Lack of uncertainty quantification in graph neural networks.
method Introduces Latent Graph Neural Stochastic Differential Equations (LGNSDE) with Bayesian prior-posterior mechanism and Brownian motion.
result LGNSDEs provide theoretically sensible guarantees for uncertainty estimates and are robust to perturbations.
Continuing our previous work (arXiv:1509.07981v1), we derive another global gradient estimate for positive functions, particularly for positive solutions to the heat equation on finite or locally finite graphs. In general, the gradient estimate in the present paper is independent of our previous one. As applications, i…
Polynomial-time algorithm estimates edge density of random graphs with privacy and robustness.
problem Estimating edge density of random graphs while maintaining privacy and robustness.
method Sum-of-squares algorithm for robust edge density estimation and reduction from privacy to robustness.
result Optimal error rate up to logarithmic factors, matching theoretical lower bounds.
Paper finds how Steklov eigenvalues change on graphs and trees.
problem Understanding how Steklov eigenvalues vary on graphs and trees.
method Analyzes monotonicity of Steklov eigenvalues on graphs and trees.
result Extends Steklov eigenvalue results to higher eigenvalues and trees.
A novel algorithm for unbiased graph kernel estimation with subquadratic time complexity.
problem Efficient estimation of graph kernels for large networks.
method Random walk-based algorithm with modulation function parameterized by neural network.
result Higher-quality kernel estimates and efficient scalable learning on larger networks.
New algorithms for community detection in graphs with privacy constraints.
problem Community recovery in stochastic block models with node-wise privacy.
method Spectral clustering with privacy mechanisms, including privatized PCA, convex optimization, and matrix estimation.
result Developed algorithms that are computable in polynomial-time and achieve consistent community estimation under node differential privacy.
In this overview report we generalize Erhard Heinz' curvature estimate for minimal graphs in R^3 to graphs in R^n of prescribed mean curvature. Secondly, we analyse these problems in the frame of the outer differential geometry which leads us to the notions of normal torsion and normal curvature for immersions in R^4.
Graph neural controlled differential equations learn graph dynamics from vertex observations.
problem Predicting future states of dynamical systems on graphs with limited vertex data.
method Incorporates graph topology information into NCDE to predict graph dynamics.
result Informed NCDE requires fewer parameters and lower MAE compared to previous methods.
Using Schauder's theory for linear elliptic partial differential equations in two independent variables and fundamental estimates for univalent mappings due to E. Heinz we establish an upper bound of the Gaussian curvature of two-dimensional minimal surface graphs in R^n. This leads us to a theorem of Bernstein-Liouvil…
DCCD-CONF discovers causal graphs with unmeasured confounders.
problem Discovering causal relationships in systems with unmeasured confounders.
method Differentiable learning of nonlinear cyclic causal graphs using interventional data.
result DCCD-CONF outperforms state-of-the-art methods in causal graph recovery and confounder identification.
The reparameterization trick enables optimizing large scale stochastic computation graphs via gradient descent. The essence of the trick is to refactor each stochastic node into a differentiable function of its parameters and a random variable with fixed distribution. After refactoring, the gradients of the loss propag…
Recent results in coupled or temporal graphical models offer schemes for estimating the relationship structure between features when the data come from related (but distinct) longitudinal sources. A novel application of these ideas is for analyzing group-level differences, i.e., in identifying if trends of estimated ob…
The paper compares PINN methods for solving drift-diffusion equations on metric graphs.
problem Solving drift-diffusion equations on metric graphs using machine learning.
method Comparison of physics-informed neural networks (PINNs) for solving drift-diffusion equations on metric graphs.
result PINNs offer a flexible and versatile tool for solving parameter identification or optimization problems on metric graphs.
Critical graphs of quadratic differentials equidistribute in moduli space.
problem Distribution of critical graphs in moduli space.
method Study of Jenkins-Strebel differentials and their critical graphs.
result Critical graphs equidistribute to the Kontsevich measure.
A new unbiased Hessian estimator for expectation-based objectives.
problem Estimating Hessian for objectives with non-reparameterizable nodes.
method GO Hessian estimator for expectation-based objectives.
result GO Hessian provides unbiased and low-variance estimation of Hessian.
Paper presents voxel graph operators for vector data models.
problem Efficient conversion and analysis of geometric models.
method Topological voxelization, graph construction, differential operator derivation.
result Discrete differential and integral operators from voxel complexes.
Study uniformly differentiable graphs in Carnot groups, proving area formulas.
problem Characterize uniformly differentiable intrinsic graphs in Carnot groups.
method Characterize uniform intrinsic differentiability via Hölder properties of projections of vector fields.
result Explicit area formula for uniformly intrinsically differentiable maps in Carnot groups.
Unified framework for differentiable graph partitioning with probabilistic cuts.
problem Lack of general guarantees and principled gradients in prior probabilistic relaxations of graph cuts.
method Unified probabilistic framework covering a wide class of cuts, including Normalized Cut, with tight analytic upper bounds.
result Rigorous, numerically stable foundation for scalable, differentiable graph partitioning.
Researchers use estimated Kolmogorov complexity for better link prediction in graphs.
problem Improving link prediction accuracy in complex networks.
method Regularization based on an approximation of Kolmogorov complexity, which is differentiable and compatible with recent link prediction algorithms.
result The regularization method shows good performance on diverse real-world networks, but the success is likely due to an aggregation method rather than actual estimation of Kolmogorov complexity.
On the ambient space of a Lie group with a left invariant metric that is isometric and isomorphic to a semidirect product R2⋊AR, we consider a domain Ω⊆R2⋊A{0} and vertical π-graphs over Ω and study the partial differential equation a function $u:Ω\rightarro…
New method resolves inconsistency in learning directed acyclic graphs using penalized likelihood.
problem Inconsistency of ℓ1-penalized likelihood in learning directed acyclic graphs. method Developed a hybrid differentiable structure learning method based on ℓ0-penalized likelihood with hard acyclicity constraint. result Demonstrated and explained why ℓ1-penalized likelihood is fundamentally inconsistent in identifying true structure up to Markov equivalence classes. Study uses graph techniques to understand meromorphic quadratic differential strata.
problem Understanding the topology of meromorphic quadratic differential strata.
method Exchange graph techniques to study fundamental groups; generalizes relations for mixed-angulations.
result Explicit presentations of fundamental groups in genus-zero case with four singularities.
We consider the problem of estimating the difference between two functional undirected graphical models with shared structures. In many applications, data are naturally regarded as high-dimensional random function vectors rather than multivariate scalars. For example, electroencephalography (EEG) data are more appropri…
New method recovers graph latent positions under edge differential privacy.
problem Recovering latent graph information from privatized graphs.
method Applying geometric insights to adjust statistical inference for privatized graphs.
result Achieves consistent recovery of latent positions under local edge differential privacy constraints.
New forms calibrate minimal graphs in arbitrary dimensions.
problem Calibrating minimal graphs in arbitrary codimension.
method Constructing closed forms from minimal graphs and estimating their comass.
result Conditions ensuring minimal graphs are calibrated and area-minimizing.
NeuroSteiner uses neural networks to estimate wirelength more efficiently.
problem Minimizing wirelength in chip design.
method Neural model trained on synthesized nets to estimate WL.
result NeuroSteiner achieves 0.3% WL error at 60% faster than GeoSteiner.
Neural GDEs improve graph prediction by blending discrete structures and differential equations.
problem Dynamic graph prediction challenges in irregularly sampled data.
method Continuous-depth graph neural networks (GNNs) with Neural GDEs.
result Neural GDEs enhance performance across various applications.
Study automorphisms of smooth curve graphs on surfaces.
problem Understanding automorphisms of fine curve graphs.
method Examined automorphisms of continuously differentiable curves on surfaces.
result Automorphisms on surfaces of genus ≥ 2 are induced by homeomorphisms.
This paper investigates the use of methods from partial differential equations and the Calculus of variations to study learning problems that are regularized using graph Laplacians. Graph Laplacians are a powerful, flexible method for capturing local and global geometry in many classes of learning problems, and the tec…
INDEQS: A Graph-Based Neural Controlled Differential Equation Framework for Forecasting
problem Forecasting time series with neural networks
method Incorporating prior knowledge of a directed graph
result Outer informedness consistently improves forecasting accuracy
Differentially private graph learning via bounded sensitivity PPR.
problem Protecting user data in graph learning algorithms.
method Proposes a sensitivity-bounded personalized PageRank (PPR) algorithm.
result Achieves similar accuracy to non-private algorithms with large degrees.
CASPER improves DAG structure learning by integrating graph structure into score function.
problem Discovering suboptimal DAGs and model vulnerabilities in causal discovery.
method CASPER integrates graph structure into the score function as a new measure in the causal space, enhancing DAG structure learning via adaptive attention to DAG-ness.
result CASPER outperforms state-of-the-art methods in terms of accuracy and robustness.
AMES framework selects optimal embedding space for latent graph inference.
problem No principled method for choosing the best embedding space for latent graph inference.
method Differentiable AMES framework using backpropagation to select optimal embedding space.
result Consistently achieves comparable or superior results across multiple datasets.
Paper classifies minimal graph transformations into new families of surfaces.
problem Classifying minimal graph transformations into new families of surfaces.
method Formulated and solved a coupled system of partial differential equations, reduced to solving an ordinary differential equation.
result Established rigorous equivalence to a modified problem for a harmonic function, yielding new families of minimal surfaces.
This paper bounds min-entropy leakage for Blowfish privacy using graph symmetries.
problem Bounding min-entropy leakage for Blowfish privacy mechanisms.
method Organizing analysis over symmetrical partitions corresponding to orbits of graph automorphism groups.
result Demonstrates a construction meeting the bound with asymptotic equality, showing tightness.
Utilizing a weight matrix we study surfaces of prescribed weighted mean curvature which yield a natural generalisation to critical points of anisotropic surface energies. We first derive a differential equation for the normal of immersions with prescribed weighted mean curvature, generalising a result of Clarenz and vo…
Study privacy vs. utility in estimating network parameters with aggregated data.
problem Privacy-preserving estimation of network parameters from aggregated node degrees.
method β model, local and central differential privacy, minimax lower bounds, simple estimators.
result Achieved minimax-optimal risk bounds for parameter estimation under privacy constraints.
The Mutual Information (MI) is an often used measure of dependency between two random variables utilized in information theory, statistics and machine learning. Recently several MI estimators have been proposed that can achieve parametric MSE convergence rate. However, most of the previously proposed estimators have th…