{"id":"d23c7968-49b0-4590-9ebe-75d673407b70","arxiv_id":"2605.25690","paper_version":1,"verdict":"UNVERDICTED","confidence":"LOW","novelty_score":4.0,"correctness_risk":"unknown","formal_verification":"none","parameter_count":0,"one_line_summary":"GCIB denoises auxiliary behavior graphs via graph information bottleneck and enriches target embeddings through cross-behavior graph contrastive learning for improved multi-behavior recommendation.","lead":"GCIB is a framework that applies graph information bottleneck to remove noise from auxiliary user behavior graphs and uses cross-behavior contrastive learning to strengthen sparse target behavior representations in recommender systems. Smart generalists might read it to see a practical approach for handling noisy multi-behavior data common in real recommendation platforms.","discovery_kind":"new_method","skeptic_critique":{"model":"grok-4.3","headline":"GIB may fail to denoise when sparse target graph supplies insufficient signal for reliable MI-based pattern selection","rationale":"The identified concern directly tracks the reader's weakest assumption (GIB without reliable target supervision). The abstract states the sparsity problem but supplies no ablations, MI estimator details, or sparsity-sensitivity results, so the unverdicted status is appropriate until those checks are performed.","tokens_in":1747,"tokens_out":350,"duration_ms":25615,"concrete_test":"On a synthetic multi-behavior graph with 10k nodes, plant 20% relevant auxiliary edges (correlated with target) and 20% spurious edges (uncorrelated). Train the GIB component alone while varying target edge density from 5% down to 0.5%. Measure precision@K of retained edges against ground-truth relevant set; if spurious retention exceeds 15% at densities matching real target sparsity, the denoising claim does not hold.","verdict_should_be":"UNCHANGED","load_bearing_attack":"The central claim rests on the GIB objective max I(denoised_aux, target) − I(denoised_aux, orig_aux) successfully isolating task-relevant structure. Because the target-behavior graph is the only source of task relevance and is acknowledged to be sparse, any MI estimator (variational or otherwise) operates on a low-density anchor. This creates a concrete risk that the bottleneck either under-suppresses spurious auxiliary edges (when the target signal is too weak) or collapses representations (when the estimator overfits the few observed target edges). No other supervision is introduced to compensate, making this the least-secured link between the proposed objective and the claimed noise-resilient representations.","agreement_with_reader":"agree"},"referee_report":{"model":"grok-4.3","summary":"The paper proposes GCIB, a framework for multi-behavior recommendation that applies a Graph Information Bottleneck (GIB) objective at the structural level to denoise auxiliary behavior graphs—maximizing mutual information with the target-behavior graph while minimizing it with the original auxiliary graph—and a cross-behavior Graph Contrastive Learning (GCL) scheme at the feature level to enrich sparse target representations. It claims this yields noise-resilient, target-aware embeddings and superior empirical performance over state-of-the-art baselines.","tokens_in":1861,"tokens_out":423,"duration_ms":17745,"significance":"If the claimed denoising and enrichment effects hold under rigorous validation, the work would offer a principled information-theoretic approach to leveraging noisy auxiliary behaviors in recommender systems, addressing a common practical challenge in multi-behavior settings.","major_comments":[{"comment":"Abstract and method description: the central claim that the GIB objective 'preserves task-relevant structural patterns and suppresses spurious interactions' rests on the assumption that mutual-information estimation can reliably identify relevant structure from a sparse target-behavior graph alone. No analysis is supplied of the MI estimator (variational or otherwise), its sample complexity, or behavior under low target density, leaving the denoising guarantee unverified and load-bearing for the noise-resilience claim.","section":"Abstract / Method"},{"comment":"Abstract: the paper states that auxiliary graphs 'frequently contain noisy or irrelevant interactions' yet provides no quantitative characterization of noise levels in the datasets or ablation isolating the contribution of the GIB term versus the GCL term, making it impossible to attribute performance gains specifically to the proposed bottleneck.","section":"Abstract"}],"minor_comments":[{"comment":"Notation for the GIB objective (max I(denoised_aux, target) − I(denoised_aux, orig_aux)) should be formalized with explicit definitions of the random variables and the estimator used.","section":"Abstract"}],"recommendation":"major_revision","confidential_remarks":null},"author_rebuttal":{"model":"grok-4.3","summary":"We thank the referee for the detailed and constructive feedback. We address each major comment below with clarifications and indicate the revisions we will make to strengthen the manuscript.","responses":[{"response":"We acknowledge that the manuscript does not include a dedicated analysis of the MI estimator's sample complexity or its behavior specifically under low target density. The GIB formulation follows the standard variational lower-bound approach from prior information-bottleneck literature, and the empirical gains across four datasets with varying densities provide supporting evidence. In the revision we will add: (i) an explicit description of the variational MI estimator and its implementation, (ii) an empirical study of estimator stability across target densities, and (iii) a brief discussion of practical sample-complexity considerations. A formal denoising guarantee remains outside the scope of the current work, but the added analysis will make the assumptions more transparent.","revision_made":"yes","referee_comment":"[Abstract / Method] Abstract and method description: the central claim that the GIB objective 'preserves task-relevant structural patterns and suppresses spurious interactions' rests on the assumption that mutual-information estimation can reliably identify relevant structure from a sparse target-behavior graph alone. No analysis is supplied of the MI estimator (variational or otherwise), its sample complexity, or behavior under low target density, leaving the denoising guarantee unverified and load-bearing for the noise-resilience claim."},{"response":"We agree that quantitative noise characterization and component-wise ablations would strengthen attribution of the gains. The current experiments report overall performance improvements but do not isolate the GIB term or measure noise explicitly. In the revised manuscript we will include: (i) quantitative noise metrics (e.g., Jaccard overlap and KL divergence between auxiliary and target interaction sets) for each dataset, and (ii) an ablation table that removes the GIB objective or the GCL objective individually while keeping all other components fixed. These additions will allow readers to assess the individual contributions.","revision_made":"yes","referee_comment":"[Abstract] Abstract: the paper states that auxiliary graphs 'frequently contain noisy or irrelevant interactions' yet provides no quantitative characterization of noise levels in the datasets or ablation isolating the contribution of the GIB term versus the GCL term, making it impossible to attribute performance gains specifically to the proposed bottleneck."}],"tokens_in":1366,"tokens_out":496,"duration_ms":19956,"standing_objections":[]},"desk_editor":{"model":"grok-4.3","letter":"The main point is that this paper takes the standard graph information bottleneck idea and applies it to clean auxiliary behavior graphs in recommendation by maximizing mutual information with the target graph while minimizing it with the raw auxiliary graph, then adds a cross-behavior contrastive learning step to pull in extra features for the sparse target side.\n\nWhat the work does reasonably well is name the practical problem of noisy auxiliary interactions that don't align with the target task and sketch a two-level fix: structural denoising via GIB plus feature-level view contrast. The formulation is straightforward and the abstract claims it leads to noise-resilient representations, which matches a known pain point in multi-behavior settings.\n\nThe soft spot is exactly the one in the stress-test note. The target graph is acknowledged to be sparse, so the MI term that is supposed to select relevant structure has very few reliable anchor points. A variational or other estimator could easily either fail to suppress spurious edges or collapse the representation when it overfits the few observed target interactions. The abstract gives no implementation details on the estimator, no ablation isolating the GIB term, and no sensitivity checks on target sparsity, so the central claim rests on an untested assumption about signal strength.\n\nThis is for people working on graph-based multi-behavior recommenders who already follow GIB and GCL papers. A reader in that niche might pick up the specific combination and the experimental claims, but the paper does not look like it would move the broader field.\n\nI would send it to peer review. The problem is real and the approach is coherent enough that referees can check whether the MI estimation actually works on the data they care about.","headline":"GCIB combines GIB denoising anchored on the target graph with cross-behavior contrastive enrichment, but the sparse target signal creates a real risk that the bottleneck won't reliably separate noise from signal.","tokens_in":2380,"tokens_out":413,"would_cite":false,"duration_ms":17059,"reading_group":"maybe","serious_thinker":"yes","would_accept_peer_review":true},"rs_alignment":null,"lean_confirmation":null,"pith_extraction":{"msc":[],"pacs":[],"model":"grok-4.3","headline":"GCIB applies a graph information bottleneck to remove noise from auxiliary user behaviors and uses cross-behavior contrastive learning to strengthen sparse target-behavior signals in recommender systems.","keywords":["multi-behavior recommendation","graph information bottleneck","graph contrastive learning","auxiliary behavior denoising","recommender systems","noise-resilient embeddings"],"falsifier":"An ablation that removes the GIB denoising term and measures whether recommendation accuracy on the target behavior drops or stays the same across multiple datasets.","tokens_in":2637,"feed_emoji":"📈","tokens_out":651,"duration_ms":14010,"temperature":0.7,"pith_summary":"The paper introduces GCIB to address noise in auxiliary behavior graphs that hurts target-behavior recommendation performance. It uses a Graph Information Bottleneck objective to keep only structural patterns from auxiliary graphs that align with the target task while discarding irrelevant interactions. At the feature level, it treats denoised auxiliary embeddings and target embeddings as positive views in a contrastive setup to enrich the scarcer target representations. Experiments show this combination produces more accurate user and item embeddings than prior multi-behavior methods. The approach matters because real-world platforms often have abundant but noisy auxiliary signals such as clicks or views alongside sparse purchases.","feed_headline":"Graph bottleneck removes noise from auxiliary behaviors to improve target recommendations","feed_subtitle":"GCIB keeps only the structural patterns in auxiliary graphs that align with the target task and contrasts the resulting features to enrich s","key_machinery":"Graph Information Bottleneck (GIB) objective that compresses auxiliary graphs to retain only target-aligned structure, paired with cross-behavior Graph Contrastive Learning (GCL) that contrasts denoised auxiliary and target features as positive pairs.","core_discovery":"GCIB employs a Graph Information Bottleneck objective that maximizes mutual information between the compressed auxiliary graph and the target-behavior graph while minimizing mutual information with the raw auxiliary graph; it then applies cross-behavior graph contrastive learning so that denoised auxiliary features and target features serve as complementary views for users and items, thereby producing noise-resilient and target-aware embeddings.","pith_inferences":["If the GIB compression step proves stable, the same principle could extend to other multi-view graph tasks such as multi-modal recommendation.","The method implicitly assumes that target behavior provides a sufficient anchor for mutual-information calculations; relaxing this could require new regularization terms.","Performance gains on sparse target behaviors suggest the framework may help cold-start users who have only auxiliary interactions recorded."],"forward_implications":["Auxiliary behavior graphs can be treated as noisy observations that are compressible to a target-relevant subgraph.","Target-behavior representations become denser when contrasted against denoised auxiliary features.","The same framework can be applied whenever one behavior type is sparse and others are abundant but partially irrelevant.","Structural denoising and feature-level contrast operate independently and can be combined without mutual interference."],"fun_headline_variants":["GCIB denoises auxiliary graphs via information bottleneck","Graph bottleneck aligns auxiliary patterns to target task","Contrastive views enrich target features from denoised auxiliaries","GIB suppresses noise while maximizing target graph signals","Cross-behavior contrastive learning for noise-resilient embeddings"],"cache_read_input_tokens":2112,"weakest_assumption_plain":"The GIB objective can reliably select task-relevant structural patterns from auxiliary graphs even though it receives no direct labels from the target behavior.","fun_headline_variants_meta":{"raw":{"variants":["GCIB denoises auxiliary graphs via information bottleneck","Graph bottleneck aligns auxiliary patterns to target task","Contrastive views enrich target features from denoised auxiliaries","GIB suppresses noise while maximizing target graph signals","Cross-behavior contrastive learning for noise-resilient embeddings"]},"model":"grok-4.3","cost_usd":0.00329,"raw_usage":{"total_tokens":1765,"prompt_tokens":683,"num_sources_used":0,"completion_tokens":71,"cost_in_usd_ticks":32899500,"prompt_tokens_details":{"text_tokens":683,"audio_tokens":0,"image_tokens":0,"cached_tokens":256},"completion_tokens_details":{"audio_tokens":0,"reasoning_tokens":1011,"accepted_prediction_tokens":0,"rejected_prediction_tokens":0}},"tokens_in":683,"tokens_out":71,"duration_ms":8837,"temperature":1.0,"reasoning_tokens":1011,"cache_read_input_tokens":256,"cache_creation_input_tokens":0},"cache_creation_input_tokens":0},"created_at":"2026-06-29T20:24:35.572043+00:00","model_set":{"reader":"grok-4.3"},"falsifier":"An ablation that removes the GIB denoising term and measures whether recommendation accuracy on the target behavior drops or stays the same across multiple datasets.","supporting_citations":[],"review_version":1}