No article text was recorded for this version.
non-convex optimization landscape (non-convex graph optimization)
Version 1 of 183 papers85 conceptsfrozen 2026-10-04
Papers in this version
- Blog: DAGs with No Curl: An Efficient DAG Structure Learning Approach
- Blog: On Causal Discovery with Cyclic Additive Noise Models
- Blog: Link Prediction Algorithms for Social Networks Based on Machine Learning and HARP
- Blog: On the Role of Sparsity and DAG Constraints for Learning Linear DAGs
- Blog: Improved Semi-Supervised Learning with Multiple Graphs
- Blog: Linear-Time Gromov Wasserstein Distances using Low Rank Couplings and Costs
- Blog: Link Prediction via Subgraph Embedding-Based Convex Matrix Completion
- Blog: Exploiting Independent Instruments: Identification and Distribution Generalization
- Blog: Manifold-based Similarity Adaptation for Label Propagation
- Blog: Learning to Rank in Vector Spaces and Social Networks
- Blog: Sample Efficient Graph-Based Optimization with Noisy Observations
- Blog: Joint Cuts and Matching of Partitions in One Graph
- Blog: CURATE: Scaling-up Differentially Private Causal Graph Discovery
- Blog: Centrality-constrained graph embedding
- Blog: Learning Graphical Model Structure Using L1-Regularization Paths
- Blog: Spectral Clustering with Graph Neural Networks for Graph Pooling
- Blog: Graph Optimization Approach to Range-Based Localization
- Blog: Continuous Bayesian Model Selection for Multivariate Causal Discovery
- Blog: EvA: Evolutionary Attacks on Graphs
- Blog: Your Assumed DAG is Wrong and Here's How To Deal With It
- Blog: Smooth-projected Neighborhood Pursuit for High-dimensional Nonparanormal Graph Estimation
- Blog: Subgraph Matching via Partial Optimal Transport
- Blog: Summarizing Labeled Multi-Graphs
- Blog: Modeling Discrete Interventional Data using Directed Cyclic Graphical Models
- Blog: An Algorithm for Finding Optimal k-Core in Attribute Networks
- Blog: Identifiable Nonlinear Differentiable Causal Discovery via Independence and Adaptive Group Sparsity
- Blog: Graphical continuous Lyapunov models
- Blog: Differentiable Causal Discovery Under Unmeasured Confounding
- Blog: On the Role of Sparsity and DAG Constraints for Learning Linear DAGs
- Blog: Learning Kronecker-Structured Graphs from Smooth Signals
- Blog: On the Optimization Trajectory of DeepWalk Embeddings
- Blog: Effiecient Graph Matching by Adjacency Matrix Based Model and Gaussian Smoothing Based Optimization
- Blog: Non-negative Weighted DAG Structure Learning
- Blog: Graph Topology Inference Based on Sparsifying Transform Learning
- Blog: Stable Differentiable Causal Discovery
- Blog: Dissimilarity in Graph-Based Semi-Supervised Classification
- Blog: A Graph Dynamics Prior for Relational Inference
- Blog: Penalized estimation of directed acyclic graphs from discrete data
- Blog: Causal Structural Learning from Time Series: A Convex Optimization Approach
- Blog: Embedding Identity and Interest for Social Networks
- Blog: Robust Causal Discovery Under Imperfect Structural Constraints
- Blog: ProDAG: Projection-induced variational inference for directed acyclic graphs
- Blog: Stable Differentiable Causal Discovery
- Blog: Conditional Tree Matching for Inference-Time Adaptation of Tree Prediction Models
- Blog: Optimizing NOTEARS Objectives via Topological Swaps
- Blog: Orthogonal Gromov-Wasserstein discrepancy with efficient lower bound
- Blog: Deformable Graph Matching
- Blog: Learning Sparse Nonparametric DAGs
- Blog: KerGM: Kernelized Graph Matching
- Blog: fGOT: Graph Distances Based on Filters and Optimal Transport
- Blog: On the Identifiability and Estimation of Causal Location-Scale Noise Models
- Blog: Large Graph Construction for Scalable Semi-Supervised Learning
- Blog: Approximate Frank-Wolfe Algorithms over Graph-structured Support Sets
- Blog: Learning Graphs from Smooth Signals under Moment Uncertainty
- Blog: Differentiable and Transportable Structure Learning
- Blog: On Sparse Gaussian Chain Graph Models
- Blog: Incremental Multi-graph Matching via Diversity and Randomness Based Graph Clustering
- Blog: Learning Scale-Free Networks by Dynamic Node Specific Degree Prior
- Blog: Efficient parameter learning of Bayesian network classifiers
- Blog: Learning Nonparametric Forest Graphical Models with Prior Information
Showing 60 of 83 papers.
History & citation
Current · Permanent link
Cite this direction
Latest version (a living page):
@misc{lacuna_non_convex_optimization_landscape_non_co_d07591b3,
title = {non-convex optimization landscape (non-convex graph optimization)},
author = {{Lacuna}},
howpublished = {Lacuna research direction},
year = {2026},
url = {https://lacuna.tiptreesystems.com/direction/non-convex-optimization-landscape-non-convex-graph-optimization/rdr_d07591b3789f463fb4888ecbaa1c1650},
note = {Latest version of a living research direction; cite a version for a fixed text. Accessed 2026-11-20},
}This exact version (version 1, frozen text):
@misc{lacuna_non_convex_optimization_landscape_non_co_d07591b3_v1,
title = {non-convex optimization landscape (non-convex graph optimization)},
author = {{Lacuna}},
howpublished = {Lacuna research direction},
year = {2026},
url = {https://lacuna.tiptreesystems.com/direction/non-convex-optimization-landscape-non-convex-graph-optimization/rdr_d07591b3789f463fb4888ecbaa1c1650/v/1},
note = {Version 1, frozen 2026-10-04. Accessed 2026-11-20},
}