pith. sign in

arxiv: 2605.20962 · v1 · pith:UIF6NSQInew · submitted 2026-05-20 · 🧮 math.OC

No-regret optimization of time-varying bilevel problems

Eliabelle Mauduit , Elo\"ise Berthier , Andrea Simonetto This is my paper

Pith reviewed 2026-05-21 03:37 UTC · model grok-4.3

classification 🧮 math.OC
keywords bilevel optimizationdynamic regretBayesian optimizationGaussian processestime-varying problemsno-regret learninggame-theoretic optimization
0
0 comments X

The pith

W-SparQ-BL achieves sublinear dynamic regret for bilevel optimization with time-varying lower-level responses observed through noisy zeroth-order data.

A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.

The paper addresses bilevel optimization where the upper-level objective is known but the lower-level response is unknown, potentially time-varying, and only accessible via noisy zeroth-order observations. It introduces W-SparQ-BL as a Bayesian optimization approach that models the lower-level mapping with multi-output Gaussian processes and applies a sparse observation-based approximation to manage noise and temporal changes while using limited additional information. Regularity results are established to connect the lower-level response to reproducing kernel Hilbert space assumptions for standard kernels such as Matérn and squared exponential. The central result is a proof that this framework attains sublinear dynamic regret in both stationary and time-varying cases, with supporting experiments on game-theoretic problems.

Core claim

W-SparQ-BL is a Bayesian optimization framework that models the lower-level mapping using multi-output Gaussian processes and a sparse, observation-based approximation to control noise and temporal variability. Under regularity conditions that link the lower-level response to standard RKHS assumptions for kernels including Matérn and squared exponential, the method achieves sublinear dynamic regret in both stationary and time-varying bilevel settings while requiring only limited access to additional information over time.

What carries the argument

W-SparQ-BL, the Bayesian optimization framework that models the lower-level mapping with multi-output Gaussian processes and a sparse observation-based approximation to handle uncertainty and time variation.

Load-bearing premise

The lower-level response satisfies regularity conditions that align with reproducing kernel Hilbert space assumptions for common kernels such as Matérn and squared exponential.

What would settle it

An experiment or calculation showing that dynamic regret grows linearly or faster with the time horizon in a time-varying bilevel setting would disprove the sublinear regret guarantee.

Figures

Figures reproduced from arXiv: 2605.20962 by Andrea Simonetto, Eliabelle Mauduit, Elo\"ise Berthier.

Figure 1
Figure 1. Figure 1: One step of a sequential game. type θt is revealed only after the learner selects xt, so decisions must be made without knowledge of the current opponent state. A typical interaction is illustrated in [PITH_FULL_IMAGE:figures/full_fig_p004_1.png] view at source ↗
Figure 2
Figure 2. Figure 2: Average dynamic regret under congestion drift. [PITH_FULL_IMAGE:figures/full_fig_p008_2.png] view at source ↗
Figure 3
Figure 3. Figure 3: Average cumulative regret of W-SparQ-BL and GP-UCBL under increasing levels of temporal variability. In the stationary and moderate variation regimes, both methods achieve comparable performance, as expected since temporal adaptation is not required. We can even note that GP-UCBL slightly outper￾forms W-SparQ-BL, likely due to the noise model of the latter that favors unnecessary exploration in these setti… view at source ↗
Figure 4
Figure 4. Figure 4: Schematic representation of the Sioux-Falls road graph. [PITH_FULL_IMAGE:figures/full_fig_p016_4.png] view at source ↗
Figure 5
Figure 5. Figure 5: Average dynamic cumulative regret for different choices of [PITH_FULL_IMAGE:figures/full_fig_p016_5.png] view at source ↗
read the original abstract

Bilevel optimization problems arise in many applications where decisions must account for the optimal response of another system, such as in game-theoretic settings. However, these problems are notoriously challenging, as even linear bilevel programs are strongly NP-hard. In this work, we consider bilevel optimization with a known upper-level objective and an unknown, potentially time-varying lower-level response, accessible only through noisy zeroth-order observations. We propose W-SparQ-BL, a Bayesian optimization framework that models the lower-level mapping using multi-output Gaussian processes and enables efficient optimization under uncertainty. Our approach leverages a sparse, observation-based approximation to control the effect of noise and temporal variability, while requiring only limited access to additional information over time. We establish regularity results linking the lower-level response to standard RKHS assumptions for common kernels, including Mat\'ern and squared exponential. We prove that W-SparQ-BL achieves sublinear dynamic regret in both stationary and time-varying settings. Experiments on representative time-varying game-theoretic problems demonstrate the effectiveness of our approach.

Editorial analysis

A structured set of objections, weighed in public.

Desk editor's note, referee report, simulated authors' rebuttal, and a circularity audit. Tearing a paper down is the easy half of reading it; the pith above is the substance, this is the friction.

Referee Report

1 major / 2 minor

Summary. The manuscript introduces W-SparQ-BL, a Bayesian optimization framework that models the unknown lower-level response in bilevel problems via multi-output Gaussian processes and a sparse, observation-based approximation. It establishes regularity results connecting the lower-level mapping to bounded RKHS norms under Matérn and squared-exponential kernels, proves sublinear dynamic regret for both stationary and time-varying settings under noisy zeroth-order queries, and validates the approach on representative time-varying game-theoretic problems.

Significance. If the central regret claims hold, the contribution would be significant for extending no-regret optimization to dynamic bilevel settings with limited information access. The linkage of lower-level responses to standard RKHS assumptions for common kernels and the use of sparse approximations to handle noise and variability are strengths that could enable practical algorithms in game-theoretic and online decision applications.

major comments (1)
  1. Abstract and the dynamic-regret theorem for the time-varying case: the sublinear dynamic regret claim rests on per-time-slice RKHS regularity (bounded norm under Matérn or squared-exponential kernels) together with the sparse approximation. Standard dynamic-regret analyses yield bounds of the form O(√T + V_T), where V_T denotes the total variation of the sequence of lower-level optimal responses. The manuscript does not appear to derive or impose an explicit bound on V_T from the stated RKHS assumptions alone; if each time slice is treated independently or arbitrary drift within the RKHS ball is permitted, the tracking term can become linear, undermining the sublinear guarantee.
minor comments (2)
  1. Experimental section: the description of data-exclusion rules, hyperparameter selection, and error-bar computation should be expanded to support reproducibility of the reported regret curves.
  2. Notation and model section: clarify how the sparse approximation is constructed from observations and how it interacts with the multi-output GP to control the effect of temporal variability across time steps.

Simulated Author's Rebuttal

1 responses · 0 unresolved

We are grateful to the referee for the detailed and insightful comments. We provide a point-by-point response to the major comment and outline the revisions we will make to address the concerns raised.

read point-by-point responses

  1. Referee: Abstract and the dynamic-regret theorem for the time-varying case: the sublinear dynamic regret claim rests on per-time-slice RKHS regularity (bounded norm under Matérn or squared-exponential kernels) together with the sparse approximation. Standard dynamic-regret analyses yield bounds of the form O(√T + V_T), where V_T denotes the total variation of the sequence of lower-level optimal responses. The manuscript does not appear to derive or impose an explicit bound on V_T from the stated RKHS assumptions alone; if each time slice is treated independently or arbitrary drift within the RKHS ball is permitted, the tracking term can become linear, undermining the sublinear guarantee.

    Authors: We thank the referee for this careful observation on the dynamic-regret theorem. The analysis in the manuscript relies on the multi-output Gaussian process to model the evolution of the lower-level response over time, which, together with the sparse approximation, enables tracking with sublinear regret. However, we acknowledge that an explicit bound or assumption on the total variation V_T is not derived solely from the per-time-slice RKHS norm bounds. To strengthen the result and eliminate any ambiguity, we will revise the theorem statement and the abstract to include the standard assumption that V_T = o(T) for the time-varying case. This is a mild condition that holds in many practical time-varying settings where the underlying system does not change arbitrarily fast, and it is compatible with the GP prior. We will make this revision in the updated manuscript. revision: yes

Circularity Check

0 steps flagged

Regret analysis rests on standard RKHS assumptions and sparse approximation without reducing to fitted inputs or self-definitional steps.

full rationale

The derivation establishes regularity linking lower-level responses to bounded RKHS norms under Matérn and squared-exponential kernels, then proves sublinear dynamic regret for W-SparQ-BL in both stationary and time-varying settings. No step equates a claimed prediction or uniqueness result to its own fitted parameters or prior self-citations by construction. The central proof relies on the proposed observation-based sparse approximation and external kernel properties rather than tautological reduction. Any self-citations are non-load-bearing and the result remains independently verifiable against the stated assumptions.

Axiom & Free-Parameter Ledger

0 free parameters · 1 axioms · 0 invented entities

The central claim depends on the lower-level mapping satisfying RKHS regularity for standard kernels and on the validity of the sparse observation-based approximation; no free parameters or new entities are explicitly introduced in the abstract.

axioms (1)
  • domain assumption Lower-level response satisfies regularity results linked to standard RKHS assumptions for Matérn and squared exponential kernels.
    Invoked to support the regret analysis in both stationary and time-varying regimes.

pith-pipeline@v0.9.0 · 5709 in / 1161 out tokens · 41008 ms · 2026-05-21T03:37:25.393740+00:00 · methodology

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Lean theorems connected to this paper

Citations machine-checked in the Pith Canon. Every link opens the source theorem in the public Lean library.

What do these tags mean?
matches
The paper's claim is directly supported by a theorem in the formal canon.
supports
The theorem supports part of the paper's argument, but the paper may add assumptions or extra steps.
extends
The paper goes beyond the formal theorem; the theorem is a base layer rather than the whole result.
uses
The paper appears to rely on the theorem as machinery.
contradicts
The paper's claim conflicts with a theorem or certificate in the canon.
unclear
Pith found a possible connection, but the passage is too broad, indirect, or ambiguous to say the theorem truly supports the claim.

Reference graph

Works this paper leans on

182 extracted references · 182 canonical work pages · 2 internal anchors

  1. [1]

    Data type statistics , author =

    work page

  2. [2]

    Data generation volume worldwide 2010-2029 , author =

    work page 2010

  3. [3]

    2018 , publisher=

    Foundations of Machine Learning , author=. 2018 , publisher=

    work page 2018

  4. [4]

    Communications of the ACM , volume=

    Rule-based systems , author=. Communications of the ACM , volume=. 1985 , publisher=

    work page 1985

  5. [5]

    , booktitle=

    Spielman, Daniel A. , booktitle=. Algorithms, graph theory, and linear equations in. 2010 , organization=

    work page 2010

  6. [6]

    and Shamos, Michael I

    Preparata, Franco P. and Shamos, Michael I. , year=. Computational

    work page

  7. [7]

    and Regli, William , journal=

    Colelough, Brandon C. and Regli, William , journal=. Neuro-symbolic

    work page

  8. [8]

    Building Machine Learning and Deep Learning Models on Google Cloud Platform: A Comprehensive Guide for Beginners , pages=

    Logistic regression , author=. Building Machine Learning and Deep Learning Models on Google Cloud Platform: A Comprehensive Guide for Beginners , pages=. 2019 , publisher=

    work page 2019

  9. [9]

    Aly, Mohamed , title =

    work page

  10. [10]

    Journal of Computer and System Sciences , volume=

    A decision-theoretic generalization of on-line learning and an application to boosting , author=. Journal of Computer and System Sciences , volume=. 1997 , publisher=

    work page 1997

  11. [11]

    International Journal of Computer Trends and Technology (IJCTT) , volume=

    Supervised machine learning algorithms: classification and comparison , author=. International Journal of Computer Trends and Technology (IJCTT) , volume=

    work page

  12. [12]

    Some methods of classification and analysis of multivariate observations , author=. Proc. of 5th Berkeley Symposium on Math. Stat. and Prob. , pages=

    work page

  13. [13]

    European Conference on Machine Learning , pages=

    Random k-labelsets: An ensemble method for multilabel classification , author=. European Conference on Machine Learning , pages=. 2007 , organization=

    work page 2007

  14. [14]

    European Conference on Principles of Data Mining and Knowledge Discovery , pages=

    Knowledge discovery in multi-label phenotype data , author=. European Conference on Principles of Data Mining and Knowledge Discovery , pages=. 2001 , organization=

    work page 2001

  15. [15]

    Advances in Neural Information Processing Systems , volume=

    A kernel method for multi-labelled classification , author=. Advances in Neural Information Processing Systems , volume=

    work page

  16. [16]

    Wiley Interdisciplinary Reviews: Computational Statistics , volume=

    Linear regression , author=. Wiley Interdisciplinary Reviews: Computational Statistics , volume=. 2012 , publisher=

    work page 2012

  17. [17]

    Academic Journal of Computing & Information Science , volume=

    K-means clustering algorithm: a brief review , author=. Academic Journal of Computing & Information Science , volume=. 2021 , publisher=

    work page 2021

  18. [18]

    2020 7th International Forum on Electrical Engineering and Automation (IFEEA) , pages=

    DBSCAN clustering algorithm based on density , author=. 2020 7th International Forum on Electrical Engineering and Automation (IFEEA) , pages=. 2020 , organization=

    work page 2020

  19. [19]

    A Density-Based Algorithm for Discovering Clusters in Large Spatial Databases with Noise , booktitle =

    Ester, Martin and Kriegel, Hans-Peter and Sander, J. A Density-Based Algorithm for Discovering Clusters in Large Spatial Databases with Noise , booktitle =. 1996 , publisher =

    work page 1996

  20. [20]

    ACM Sigmod Record , volume=

    OPTICS: Ordering points to identify the clustering structure , author=. ACM Sigmod Record , volume=. 1999 , publisher=

    work page 1999

  21. [21]

    Advances in Neural Information Processing Systems , volume=

    On spectral clustering: Analysis and an algorithm , author=. Advances in Neural Information Processing Systems , volume=

    work page

  22. [22]

    European Conference on Principles of Data Mining and Knowledge Discovery , pages=

    Quality scheme assessment in the clustering process , author=. European Conference on Principles of Data Mining and Knowledge Discovery , pages=. 2000 , organization=

    work page 2000

  23. [23]

    Journal of Computational and Applied Mathematics , volume=

    Spectral clustering and its use in bioinformatics , author=. Journal of Computational and Applied Mathematics , volume=. 2007 , publisher=

    work page 2007

  24. [24]

    A survey of text clustering algorithms , author=. Mining. 2012 , publisher=

    work page 2012

  25. [25]

    2010 6th International Conference on Emerging Technologies (ICET) , pages=

    Image segmentation using fuzzy clustering: A survey , author=. 2010 6th International Conference on Emerging Technologies (ICET) , pages=. 2010 , organization=

    work page 2010

  26. [26]

    Journal of the Royal Statistical Society Series A: Statistics in Society , volume=

    Model-based clustering for social networks , author=. Journal of the Royal Statistical Society Series A: Statistics in Society , volume=. 2007 , publisher=

    work page 2007

  27. [27]

    Deep clustering: A comprehensive survey , author=. IEEE. 2024 , publisher=

    work page 2024

  28. [28]

    Pattern Recognition , volume=

    Image clustering based on sparse patch alignment framework , author=. Pattern Recognition , volume=. 2014 , publisher=

    work page 2014

  29. [29]

    International Symposium on Rules and Rule Markup Languages for the Semantic Web , pages=

    A brief overview of rule learning , author=. International Symposium on Rules and Rule Markup Languages for the Semantic Web , pages=. 2015 , organization=

    work page 2015

  30. [30]

    Principal component analysis , author=. Wiley. 2010 , publisher=

    work page 2010

  31. [31]

    Machine Learning , volume=

    A survey on semi-supervised learning , author=. Machine Learning , volume=. 2020 , publisher=

    work page 2020

  32. [32]

    International Conference on Machine Learning , pages=

    Understanding self-predictive learning for reinforcement learning , author=. International Conference on Machine Learning , pages=

    work page

  33. [33]

    Neurocomputing , volume=

    A comprehensive survey on contrastive learning , author=. Neurocomputing , volume=. 2024 , publisher=

    work page 2024

  34. [34]

    Handbooks in

    Markov decision processes , author=. Handbooks in. 1990 , publisher=

    work page 1990

  35. [35]

    Annual Review of Control, Robotics, and Autonomous Systems , volume=

    Deep reinforcement learning for robotics: A survey of real-world successes , author=. Annual Review of Control, Robotics, and Autonomous Systems , volume=. 2025 , publisher=

    work page 2025

  36. [36]

    Least squares quantization in

    Lloyd, Stuart , journal=. Least squares quantization in. 1982 , publisher=

    work page 1982

  37. [37]

    Joint optimization of water allocation and water quality management in

    Martinsen, Grith and Liu, Suxia and Mo, Xingguo and Bauer-Gottwein, Peter , journal=. Joint optimization of water allocation and water quality management in. 2019 , publisher=

    work page 2019

  38. [38]

    , volume=

    Kreps, David M. , volume=. Microeconomic. 2013 , publisher=

    work page 2013

  39. [39]

    EAS Publications Series , volume=

    Introduction to optimization with applications in astronomy and astrophysics , author=. EAS Publications Series , volume=. 2016 , publisher=

    work page 2016

  40. [40]

    2020 , publisher=

    Integer Programming , author=. 2020 , publisher=

    work page 2020

  41. [41]

    Introduction to

    Du, Ding-Zhu and Pardalos, Panos M and Hu, Xiaodong and Wu, Weili , volume=. Introduction to. 2022 , publisher=

    work page 2022

  42. [42]

    Information Sciences , year=

    A Review on Semi-supervised Clustering , author=. Information Sciences , year=

    work page

  43. [43]

    2012 , issn =

    Spectral clustering: A semi-supervised approach , journal =. 2012 , issn =. doi:https://doi.org/10.1016/j.neucom.2011.09.002 , url =

    work page doi:10.1016/j.neucom.2011.09.002 2012

  44. [44]

    2019 , issn =

    Auto-weighted Multi-view learning for Semi-Supervised graph clustering , journal =. 2019 , issn =. doi:https://doi.org/10.1016/j.neucom.2019.07.011 , url =

    work page doi:10.1016/j.neucom.2019.07.011 2019

  45. [45]

    Automatic Extraction of Clusters from Hierarchical Clustering Representations , booktitle=

    Sander, J. Automatic Extraction of Clusters from Hierarchical Clustering Representations , booktitle=. 2003 , publisher=

    work page 2003

  46. [46]

    2015 , issn =

    Large-scale spectral clustering based on pairwise constraints , journal =. 2015 , issn =. doi:https://doi.org/10.1016/j.ipm.2015.05.007 , url =

    work page doi:10.1016/j.ipm.2015.05.007 2015

  47. [47]

    International Journal of Machine Learning and Cybernetics , volume=

    Clustering data with partial background information , author=. International Journal of Machine Learning and Cybernetics , volume=. 2019 , publisher=

    work page 2019

  48. [48]

    Knowledge Discovery in Databases: PKDD 2005: 9th European Conference on Principles and Practice of Knowledge Discovery in Databases , pages=

    Agglomerative hierarchical clustering with constraints: Theoretical and empirical results , author=. Knowledge Discovery in Databases: PKDD 2005: 9th European Conference on Principles and Practice of Knowledge Discovery in Databases , pages=. 2005 , organization=

    work page 2005

  49. [49]

    Machine Learning , volume=

    Order preserving hierarchical agglomerative clustering , author=. Machine Learning , volume=. 2022 , publisher=

    work page 2022

  50. [50]

    International Conference on Machine Learning , pages=

    Hierarchical clustering with structural constraints , author=. International Conference on Machine Learning , pages=

    work page

  51. [51]

    Proceedings of the 2013 SIAM International Conference on Data Mining , pages=

    Constrained spectral clustering using l1 regularization , author=. Proceedings of the 2013 SIAM International Conference on Data Mining , pages=

    work page 2013

  52. [52]

    Statistics and Computing , volume=

    A tutorial on spectral clustering , author=. Statistics and Computing , volume=. 2007 , publisher=

    work page 2007

  53. [53]

    Knowledge-Based Systems , volume=

    A survey on federated learning , author=. Knowledge-Based Systems , volume=. 2021 , publisher=

    work page 2021

  54. [54]

    Proceedings of the 2004 SIAM International Conference on Data Mining , pages=

    Active semi-supervision for pairwise constrained clustering , author=. Proceedings of the 2004 SIAM International Conference on Data Mining , pages=

    work page 2004

  55. [55]

    Data Mining and Knowledge Discovery , volume=

    On constrained spectral clustering and its applications , author=. Data Mining and Knowledge Discovery , volume=. 2014 , publisher=

    work page 2014

  56. [56]

    Artificial Intelligence Review , volume=

    A survey of outlier detection methodologies , author=. Artificial Intelligence Review , volume=. 2004 , publisher=

    work page 2004

  57. [57]

    1930 , publisher=

    Quantitative expression of cultural relationships , author=. 1930 , publisher=

    work page 1930

  58. [58]

    Edwards brother, Incorporated , author=

    Cluster analysis: correlation profile and orthometric (factor) analysis for the isolation of unities in mind and personality. Edwards brother, Incorporated , author=. Ann Arbor , year=

    work page

  59. [59]

    Sneath, Peter H. A. and Sokal, Robert R. , title =

    work page

  60. [60]

    2006 International Conference on Web Intelligence (WI 2006 Main Conference Proceedings)(WI'06) , pages=

    Personalized hierarchical clustering , author=. 2006 International Conference on Web Intelligence (WI 2006 Main Conference Proceedings)(WI'06) , pages=. 2006 , organization=

    work page 2006

  61. [61]

    Proceedings of the 21st International Database Engineering & Applications Symposium , pages=

    Constrained hierarchical clustering for news events , author=. Proceedings of the 21st International Database Engineering & Applications Symposium , pages=

    work page

  62. [62]

    IEEE Transactions on Signal Processing , volume=

    Hierarchical clustering given confidence intervals of metric distances , author=. IEEE Transactions on Signal Processing , volume=. 2018 , publisher=

    work page 2018

  63. [63]

    Journal of Big Data , volume=

    A survey of transfer learning , author=. Journal of Big Data , volume=. 2016 , publisher=

    work page 2016

  64. [64]

    Tenth IEEE International Conference on Computer Vision (ICCV'05) Volume 1 , volume=

    Manifold clustering , author=. Tenth IEEE International Conference on Computer Vision (ICCV'05) Volume 1 , volume=

    work page

  65. [65]

    Advances in Data Analysis and Classification , volume=

    Hierarchical clustering of asymmetric networks , author=. Advances in Data Analysis and Classification , volume=. 2018 , publisher=

    work page 2018

  66. [66]

    and others , volume=

    Aggarwal, Charu C. and others , volume=. Recommender. 2016 , publisher=

    work page 2016

  67. [67]

    Lecture notes , volume=

    Introduction to online optimization , author=. Lecture notes , volume=

    work page

  68. [68]

    Journal of Machine Learning Research , volume=

    Graph Reduction with Spectral and Cut Guarantees , author=. Journal of Machine Learning Research , volume=

    work page

  69. [69]

    Psychometrika , volume=

    Hierarchical clustering schemes , author=. Psychometrika , volume=. 1967 , publisher=

    work page 1967

  70. [70]

    Inference and applications to clustering , author=

    Mixture models. Inference and applications to clustering , author=. Statistics: Textbooks and Monographs , year=

    work page

  71. [71]

    Self-organizing

    Kohonen, Teuvo , volume=. Self-organizing. 2012 , publisher=

    work page 2012

  72. [72]

    Advances in neural information processing systems , volume=

    Ultrametric fitting by gradient descent , author=. Advances in neural information processing systems , volume=

    work page

  73. [73]

    Modern hierarchical, agglomerative clustering algorithms

    Modern hierarchical, agglomerative clustering algorithms , author=. arXiv preprint arXiv:1109.2378 , year=

    work page internal anchor Pith review Pith/arXiv arXiv

  74. [74]

    2022 , issn =

    Semi-supervised consensus clustering based on closed patterns , journal =. 2022 , issn =. doi:https://doi.org/10.1016/j.knosys.2021.107599 , url =

    work page doi:10.1016/j.knosys.2021.107599 2022

  75. [75]

    AAAI/IAAI , year=

    Clustering with Instance-Level Constraints , author=. AAAI/IAAI , year=

    work page

  76. [76]

    Wiley Interdisciplinary Reviews: Computational Statistics , volume=

    Semi-supervised clustering methods , author=. Wiley Interdisciplinary Reviews: Computational Statistics , volume=. 2013 , publisher=

    work page 2013

  77. [77]

    Semi-supervised Hierarchical Clustering , year=

    Zheng, Li and Li, Tao , booktitle=. Semi-supervised Hierarchical Clustering , year=

    work page

  78. [78]

    Eisen and Paul T

    Michael B. Eisen and Paul T. Spellman and Patrick O. Brown and David Botstein , title =. Proceedings of the National Academy of Sciences , volume =. 1998 , doi =

    work page 1998

  79. [79]

    Scientific Reports , volume=

    A novel brain partition highlights the modular skeleton shared by structure and function , author=. Scientific Reports , volume=

    work page

  80. [80]

    KDD Workshop on Text Mining , volume=

    A comparison of document clustering techniques , author=. KDD Workshop on Text Mining , volume=

    work page

Showing first 80 references.