{"id":"55c9905d-01f3-4888-bad4-4a02d32e85a2","arxiv_id":"2309.14857","paper_version":3,"verdict":"UNVERDICTED","confidence":"LOW","novelty_score":5.0,"correctness_risk":"unknown","formal_verification":"none","parameter_count":1,"one_line_summary":"A manifold optimization method combining contrastive PCA and kurtosis projection pursuit generates embeddings that discount prior knowledge structures while revealing underlying cluster separation in high-dimensional data.","lead":"The paper introduces a dimensionality reduction technique that combines contrastive PCA to remove known structures from data with kurtosis projection pursuit to highlight remaining clusters, all solved via manifold optimization. Practitioners in data analysis and machine learning might use it to incorporate prior knowledge when visually exploring high-dimensional datasets for hidden patterns.","discovery_kind":"new_method","skeptic_critique":{"model":"grok-4.3","headline":"Linear combination weight between contrastive PCA and kurtosis pursuit is an untuned hyperparameter whose value controls whether remaining structure is revealed.","rationale":"Reader correctly flags the un-derived premise that the linear combination succeeds; the concrete load-bearing gap is the missing analysis of the scalar that implements that combination. The proposed sweep directly tests whether the empirical support is robust or artifactual, moving the verdict from UNVERDICTED to CONDITIONAL pending the check.","tokens_in":1737,"tokens_out":322,"duration_ms":25421,"concrete_test":"Re-run the reported experiments on all three prior-knowledge types while sweeping the combination weight over {0.1, 0.3, 0.5, 0.7, 0.9}; if any dataset shows >15% change in the reported separation metric (e.g., adjusted Rand index against held-out labels) across the sweep, the claim that the method reliably reveals remaining structure is sensitive to the untuned parameter.","verdict_should_be":"CONDITIONAL","load_bearing_attack":"The central claim requires that the combined objective, after manifold optimization, isolates structure orthogonal to the supplied prior. Because the two terms are added with an explicit scalar coefficient (the single free parameter), any guarantee that the result reveals the intended remaining clusters rather than an arbitrary trade-off rests on that coefficient being chosen correctly. No derivation, automatic selection rule, or worst-case analysis is supplied for the coefficient; empirical results therefore depend on post-hoc or default tuning whose effect on the headline claim is unquantified.","agreement_with_reader":"partial"},"referee_report":{"model":"grok-4.3","summary":"The paper proposes a dimensionality reduction method for cluster exploration that incorporates prior knowledge by linearly combining contrastive PCA (to discount known structure) with kurtosis projection pursuit (to promote separation), formulated and solved as a manifold optimization problem. It claims this yields embeddings revealing remaining underlying structure and provides an automated iterative visual exploration framework, validated empirically on multiple datasets with three types of prior knowledge.","tokens_in":1851,"tokens_out":392,"duration_ms":19516,"significance":"If the combined objective reliably isolates structure orthogonal to the supplied prior without strong dependence on manual tuning, the method would offer a practical extension of existing DR techniques for informed exploratory analysis. The manifold optimization framing and empirical coverage across prior types are positive elements, but the approach's utility hinges on robustness to its free parameter.","major_comments":[{"comment":"Method section (formulation of the objective): the linear combination weight between contrastive PCA and kurtosis projection pursuit is introduced as an explicit scalar hyperparameter with no derivation, automatic selection rule, sensitivity analysis, or worst-case guarantee. Because the central claim requires that the optimized embedding isolates remaining structure after discounting the prior, and the skeptic correctly notes that this weight directly controls the trade-off, the absence of guidance on its value makes the headline result dependent on post-hoc tuning whose effect is unquantified.","section":"Method section (objective formulation)"}],"minor_comments":[{"comment":"The abstract states that the task is formulated as a manifold optimization problem but does not specify the manifold, retraction, or solver used; this detail should be added for reproducibility.","section":"Abstract"},{"comment":"Figure captions and experimental tables should explicitly state the value(s) of the weighting parameter used for each reported result.","section":"Experiments"}],"recommendation":"major_revision","confidential_remarks":null},"author_rebuttal":{"model":"grok-4.3","summary":"We thank the referee for their constructive comments. We address the single major comment below.","responses":[{"response":"We agree that the scalar weight λ is introduced as a hyperparameter without an automatic selection procedure, theoretical derivation, or worst-case analysis in the submitted manuscript. Values were chosen empirically per dataset and prior type to achieve a practical balance between the two terms. To directly address the concern that the central claim depends on unquantified tuning, we will add a dedicated sensitivity analysis subsection (including quantitative metrics of cluster separation across a range of λ values) in the revised Method and Experiments sections. This will supply the missing guidance and robustness quantification.","revision_made":"yes","referee_comment":"[Method section (objective formulation)] Method section (formulation of the objective): the linear combination weight between contrastive PCA and kurtosis projection pursuit is introduced as an explicit scalar hyperparameter with no derivation, automatic selection rule, sensitivity analysis, or worst-case guarantee. Because the central claim requires that the optimized embedding isolates remaining structure after discounting the prior, and the skeptic correctly notes that this weight directly controls the trade-off, the absence of guidance on its value makes the headline result dependent on post-hoc tuning whose effect is unquantified."}],"tokens_in":1234,"tokens_out":275,"duration_ms":33997,"standing_objections":[]},"desk_editor":{"model":"grok-4.3","letter":"The core contribution is a linear blend of two established techniques—contrastive PCA to remove known structure and kurtosis-based projection pursuit to find other separations—optimized on the manifold. They apply it to three kinds of prior knowledge and add an iterative visual exploration loop. That synthesis for this specific use case is new, and the empirical checks across datasets give a practical sense of how it behaves in standard settings. The automated framework is a useful addition for people who actually do visual cluster hunting with side information. The experiments appear to support the basic claim that the method can surface remaining structure once the prior is discounted. The soft spot is exactly the one in the stress-test note: the weighting scalar between the two objectives is a free parameter with no derivation, selection rule, or sensitivity study. Results therefore hinge on post-hoc choice of that coefficient, which weakens the guarantee that the output reliably isolates the intended remaining clusters rather than an arbitrary compromise. No load-bearing circularity or invented entities show up. The work is aimed at practitioners in interactive data analysis who already use DR tools and have partial labels or groupings they want to set aside. A reader in that niche can get value from the concrete implementation and the three-prior test cases. It is coherent enough on its own terms to deserve a serious referee who can check the optimization details and the parameter sensitivity in the full experiments.","headline":"The paper combines contrastive PCA and kurtosis projection pursuit on a manifold to discount prior structure in DR, but the single mixing weight is an unanalyzed hyperparameter that controls the outcome.","tokens_in":2381,"tokens_out":354,"would_cite":false,"duration_ms":15127,"reading_group":"maybe","serious_thinker":"yes","would_accept_peer_review":true},"rs_alignment":{"model":"grok-4.3","evidence":[],"headline":"IMAPCE combines cPCA + kurtosis pursuit on Stiefel manifold; no overlap with J-cost, φ-ladder or distinction-forcing chain","alignment":"orthogonal","rationale":"Paper's objective (Eq. 2) is a weighted sum of Frobenius reconstruction terms and a quartic kurtosis index, optimized under V⊤V=I. This is standard manifold DR with one explicit trade-off scalar α and scaling μ; no reciprocal cost J(x)=½(x+x⁻¹)−1, no golden-ratio fixed-point identities, no 8-tick periodicity, and no parameter-free derivation of constants. RS theorems (reality_from_one_distinction, washburn_uniqueness_aczel, Jcost_pos_of_ne_one, alexander_duality_circle_linking) are never invoked or paralleled.","tokens_in":55871,"confidence":"high","tokens_out":186,"duration_ms":6732,"cache_read_input_tokens":32896,"cache_creation_input_tokens":0},"lean_confirmation":null,"pith_extraction":{"msc":[],"pacs":[],"model":"grok-4.3","headline":"A manifold optimization of contrastive PCA combined with kurtosis projection pursuit generates embeddings that discount known structure while exposing remaining clusters.","keywords":["dimensionality reduction","contrastive PCA","projection pursuit","manifold optimization","cluster exploration","prior knowledge","embeddings","visual exploration"],"falsifier":"On standard benchmark datasets supplied with explicit priors, the two-dimensional embeddings obtained by the method show no clearer separation of the remaining clusters than those produced by ordinary PCA or by contrastive PCA alone.","tokens_in":2626,"feed_emoji":"📊","tokens_out":629,"duration_ms":15414,"temperature":0.7,"pith_summary":"The paper presents a dimensionality reduction approach designed to incorporate and then remove prior knowledge about a dataset so that any leftover patterns become visible in low-dimensional views. It does this by optimizing a linear mix of two goals: contrastive PCA removes the effects of the supplied prior information, while kurtosis projection pursuit pushes the projection toward directions that separate the data points. The optimization is carried out on a manifold to respect the geometry of the projection directions. Experiments on multiple datasets with three different kinds of prior information are used to show that the resulting embeddings support visual cluster exploration. An automated iterative framework is also supplied so that users can successively refine their views of the data.","feed_headline":"Embeddings subtract known structure to expose hidden clusters","feed_subtitle":"Manifold optimization mixes contrastive PCA with kurtosis pursuit to discount priors and reveal remaining patterns.","key_machinery":"Linear combination of contrastive PCA and kurtosis projection pursuit, posed and solved as a manifold optimization problem.","core_discovery":"The paper claims that informative low-dimensional embeddings arise from solving a manifold optimization problem whose objective is a linear combination of contrastive PCA, which subtracts structure tied to supplied prior knowledge, and kurtosis projection pursuit, which promotes separation among the remaining data points; the resulting embeddings therefore factor out the known structure and reveal any underlying cluster organization that remains.","pith_inferences":["The same manifold formulation could be tested with nonlinear extensions of the two objectives to handle more complex data manifolds.","Successive applications of the method might allow systematic removal of multiple layers of known structure in a single pipeline.","The approach may be combined with interactive user feedback to refine the choice of prior at each iteration."],"forward_implications":["The embeddings discount structure associated with different kinds of prior knowledge supplied by the user.","Any remaining underlying structure becomes visible for cluster exploration in the low-dimensional space.","An automated iterative framework allows successive refinement of the visual exploration process.","Empirical results across datasets with three distinct prior types support the utility of the approach."],"fun_headline_variants":["Manifold projections discount priors to reveal clusters","Embeddings remove known structure to find hidden clusters","Combining contrastive PCA with kurtosis reveals clusters","Projections expose remaining clusters after removing priors"],"cache_read_input_tokens":2112,"weakest_assumption_plain":"The linear combination of contrastive PCA and kurtosis projection pursuit, once optimized on the manifold, will produce projections that separate the data after the prior structure has been removed.","fun_headline_variants_meta":{"raw":{"variants":["Manifold projections discount priors to reveal clusters","Embeddings remove known structure to find hidden clusters","Combining contrastive PCA with kurtosis reveals clusters","Projections expose remaining clusters after removing priors"]},"model":"grok-4.3","cost_usd":0.006807,"raw_usage":{"total_tokens":3125,"prompt_tokens":589,"num_sources_used":0,"completion_tokens":48,"cost_in_usd_ticks":68074500,"prompt_tokens_details":{"text_tokens":589,"audio_tokens":0,"image_tokens":0,"cached_tokens":256},"completion_tokens_details":{"audio_tokens":0,"reasoning_tokens":2488,"accepted_prediction_tokens":0,"rejected_prediction_tokens":0}},"tokens_in":589,"tokens_out":48,"duration_ms":17574,"temperature":1.0,"reasoning_tokens":2488,"cache_read_input_tokens":256,"cache_creation_input_tokens":0},"cache_creation_input_tokens":0},"created_at":"2026-05-24T07:25:20.606795+00:00","model_set":{"reader":"grok-4.3"},"falsifier":"On standard benchmark datasets supplied with explicit priors, the two-dimensional embeddings obtained by the method show no clearer separation of the remaining clusters than those produced by ordinary PCA or by contrastive PCA alone.","supporting_citations":[],"review_version":1}