{"id":"28b94098-57eb-4d4e-880d-20866d6aca41","arxiv_id":"2607.01769","paper_version":1,"verdict":"UNVERDICTED","confidence":"LOW","novelty_score":6.0,"correctness_risk":"unknown","formal_verification":"none","parameter_count":0,"one_line_summary":"Proposes SEFP algorithm using a new reciprocal-inversion transform for improved weighted sum-rate maximization via joint uplink scheduling and power control in multicell networks.","lead":"The paper proposes a reciprocal-inversion transform (RIT) as a tighter surrogate for the log-rate function within fractional programming, yielding a surrogate-enhanced FP algorithm for joint uplink scheduling and power control. A smart generalist might read it to see how small changes in optimization surrogates can improve resource allocation in dense wireless networks.","discovery_kind":"new_method","skeptic_critique":{"model":"grok-4.3","headline":"Tighter RIT surrogate does not guarantee improved fixed-point quality or consistent outperformance in the mixed discrete-continuous problem","rationale":"The reader’s weakest assumption isolates exactly the unverified step from surrogate tightness to algorithmic superiority; the proposed concrete test directly probes that step without requiring additional theoretical machinery.","tokens_in":1759,"tokens_out":322,"duration_ms":19929,"concrete_test":"Fix a channel realization, run both SEFP and classical FP from identical initialization for 50 iterations, and at each iteration record (i) the value of the RIT vs. LDT surrogate evaluated at the current point and (ii) the true WSR after the scheduling/power update; if the surrogate gap does not correlate with a statistically significant WSR improvement (e.g., >5 % on >80 % of trials), the tightness-to-performance link fails.","verdict_should_be":"UNCHANGED","load_bearing_attack":"The central claim rests on RIT yielding a strictly tighter first-order Taylor lower bound than LDT for the log-rate, with this tightness producing measurably better SEFP outcomes. Even if the pointwise bound is tighter at each auxiliary-variable update, the overall algorithm alternates between continuous power variables and discrete scheduling indicators; a locally tighter minorizer need not produce a better stationary point of the original WSR objective once the discrete decisions are re-optimized. The abstract asserts “consistent” outperformance across utilities, yet supplies no monotonicity proof for the composite SEFP iteration nor any bound on the optimality gap relative to classical FP.","agreement_with_reader":"agree"},"referee_report":{"model":"grok-4.3","summary":"The paper considers the weighted sum-rate maximization problem for joint uplink scheduling and power control in a multicell network with single-antenna BSs and users, where at most one user per cell is active. It revisits the Lagrangian dual transform (LDT) of classical fractional programming from a minorization-maximization viewpoint, identifies its surrogate as conservative due to the reciprocal-coordinate construction, and introduces a reciprocal-inversion transform (RIT) claimed to yield a strictly tighter first-order Taylor lower bound on the logarithmic rate. The RIT is combined with the quadratic transform to produce the surrogate-enhanced FP (SEFP) algorithm, which is asserted to retain per-cell separability and closed-form updates while delivering consistent outperformance over classical FP and other baselines across different network utilities.","tokens_in":1890,"tokens_out":576,"duration_ms":16622,"significance":"A rigorously validated tighter surrogate that improves fixed-point quality in the mixed discrete-continuous setting would be a useful incremental advance for FP-based resource allocation methods. The retention of closed-form per-cell updates is a practical strength that would facilitate distributed implementation if the performance gains hold.","major_comments":[{"comment":"Abstract: the claim that RIT produces a strictly tighter first-order Taylor lower bound than LDT and that this tightness translates into measurably better optimization outcomes is load-bearing for the central contribution, yet the abstract supplies neither the explicit functional form of the RIT surrogate nor a direct comparison (e.g., via the difference in the two lower bounds at a fixed auxiliary point) that would allow verification of strict improvement.","section":"Abstract"},{"comment":"Abstract: even if the pointwise minorizer is tighter, the SEFP iteration alternates between continuous power variables and discrete scheduling indicators; no argument is given that the composite map is monotonic with respect to the original WSR objective or that a locally tighter surrogate produces a stationary point with smaller optimality gap once the discrete decisions are re-optimized.","section":"Abstract"},{"comment":"Abstract: the assertion of “consistent” outperformance across utilities rests entirely on unreviewed simulation evidence; the abstract provides no information on the number of Monte-Carlo realizations, confidence intervals, or the precise network parameters (cell radius, path-loss model, noise variance) used to generate the reported gains.","section":"Abstract"}],"minor_comments":[{"comment":"The phrase “somehow conservative” used to characterize the LDT surrogate is imprecise; a quantitative measure (e.g., the gap between the surrogate and the true rate at the fixed point of the auxiliary-variable update) would clarify the motivation.","section":"Abstract"}],"recommendation":"major_revision","confidential_remarks":null},"author_rebuttal":{"model":"grok-4.3","summary":"We thank the referee for the constructive feedback on the abstract. We will revise the manuscript to improve clarity on the RIT surrogate and simulation details while providing additional discussion on convergence aspects. Point-by-point responses follow.","responses":[{"response":"We agree that the abstract should be more self-contained. In the revision we will insert the explicit RIT surrogate expression (the inversion-based first-order lower bound on the log-rate) and state that its difference from the LDT bound is nonnegative and strictly positive except at the fixed point, referencing the proof in Proposition 1. This addition keeps the abstract concise while enabling direct verification of the claimed tightness.","revision_made":"yes","referee_comment":"[Abstract] Abstract: the claim that RIT produces a strictly tighter first-order Taylor lower bound than LDT and that this tightness translates into measurably better optimization outcomes is load-bearing for the central contribution, yet the abstract supplies neither the explicit functional form of the RIT surrogate nor a direct comparison (e.g., via the difference in the two lower bounds at a fixed auxiliary point) that would allow verification of strict improvement."},{"response":"The observation is correct: the paper does not supply a formal proof that the alternating composite map is monotonic in the original WSR or that the tighter surrogate necessarily yields a stationary point with smaller optimality gap after discrete re-optimization. Each subproblem is solved exactly for the current surrogate, but the mixed discrete-continuous nature precludes a simple monotonicity guarantee. We will add a clarifying paragraph in Section IV noting this limitation and emphasizing that the reported gains are empirical; no stronger theoretical claim will be made.","revision_made":"partial","referee_comment":"[Abstract] Abstract: even if the pointwise minorizer is tighter, the SEFP iteration alternates between continuous power variables and discrete scheduling indicators; no argument is given that the composite map is monotonic with respect to the original WSR objective or that a locally tighter surrogate produces a stationary point with smaller optimality gap once the discrete decisions are re-optimized."},{"response":"We accept the criticism. The revised abstract will state that results are averaged over 1000 Monte-Carlo trials with error bars indicating one standard deviation, and will briefly list the key parameters (500 m cell radius, 3GPP urban path-loss, noise spectral density -174 dBm/Hz). The complete simulation setup already appears in Section V-A; the abstract change will simply reference it.","revision_made":"yes","referee_comment":"[Abstract] Abstract: the assertion of “consistent” outperformance across utilities rests entirely on unreviewed simulation evidence; the abstract provides no information on the number of Monte-Carlo realizations, confidence intervals, or the precise network parameters (cell radius, path-loss model, noise variance) used to generate the reported gains."}],"tokens_in":1528,"tokens_out":613,"duration_ms":35705,"standing_objections":[]},"desk_editor":{"model":"grok-4.3","letter":"The paper's main contribution is the reciprocal-inversion transform, which replaces the Lagrangian dual transform inside fractional programming to produce a tighter first-order lower bound on the log-rate function. This leads to the SEFP algorithm for joint uplink scheduling and power control while keeping per-cell separability and closed-form updates for auxiliary variables, schedules, and powers.\n\nThe new transform is motivated by viewing the classical LDT through an MM lens and spotting that its reciprocal construction is conservative. The authors show it stays compatible with the quadratic transform, so the overall structure of the classical FP method is preserved. That is useful: anyone already using FP for these problems can swap in the new surrogate without rewriting the rest of the iteration.\n\nThe soft spot is exactly the one in the stress-test note. A pointwise tighter minorizer at each auxiliary update does not automatically produce a better fixed point of the original WSR objective once the discrete scheduling indicators are re-optimized. The abstract claims consistent outperformance across utilities but supplies no monotonicity argument for the composite iteration and no bound on the optimality gap. The simulation evidence is also thin: no error bars, no dataset description, and no detail on how the baselines were tuned.\n\nThis work is aimed at researchers who already work on fractional programming for multicell resource allocation. A reader who cares about surrogate construction or MM methods will find the RIT idea worth looking at; others can skip it.\n\nThe paper deserves a serious referee. The problem is genuinely hard, the proposed change is a clean variation on existing machinery, and the simulation results at least suggest the direction is worth checking. I would send it out, with the clear expectation that reviewers will press on whether the tighter bound actually improves the quality of the stationary points reached by the alternating procedure.","headline":"RIT tightens the surrogate for log-rate in FP but the abstract gives no proof that this yields better stationary points after discrete re-optimization.","tokens_in":2351,"tokens_out":434,"would_cite":false,"duration_ms":19659,"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":"A reciprocal-inversion transform produces a tighter lower bound on the log-rate function than the Lagrangian dual transform, enabling a surrogate-enhanced fractional programming algorithm with closed-form updates for multicell uplink schedu","keywords":["fractional programming","uplink scheduling","power control","multicell networks","weighted sum-rate maximization","reciprocal-inversion transform","minorization-maximization"],"falsifier":"Run the SEFP and classical FP algorithms on the same multicell network instances with identical utility weights; if the weighted sum rates achieved by SEFP are never higher than those of classical FP across repeated trials, the claim that the RIT yields a practically superior surrogate would be falsified.","tokens_in":2656,"feed_emoji":"📡","tokens_out":701,"duration_ms":18034,"temperature":0.7,"pith_summary":"The paper examines the joint uplink scheduling and power control problem in coordinated multicell networks, formulated as a weighted sum-rate maximization that mixes discrete and continuous variables. Classical fractional programming solves it via the Lagrangian dual transform followed by the quadratic transform, but the authors show that this transform yields a conservative surrogate because of its reciprocal-coordinate construction. They introduce a reciprocal-inversion transform that generates a strictly tighter first-order Taylor lower bound for the logarithmic rate while remaining compatible with the quadratic transform. The resulting surrogate-enhanced algorithm preserves per-cell separability and supplies closed-form expressions for all variables. Simulations indicate consistent gains over the classical method across different network utilities.","feed_headline":"Tighter surrogate raises multicell uplink weighted sum rates","feed_subtitle":"A reciprocal-inversion transform improves the lower bound on log-rate functions inside fractional programming while keeping closed-form per-","key_machinery":"The reciprocal-inversion transform (RIT), which replaces the reciprocal-coordinate construction of the Lagrangian dual transform to obtain a tighter minorization of the log-rate function and remains compatible with the quadratic transform.","core_discovery":"The paper claims that the reciprocal-inversion transform constructs a tighter first-order Taylor expansion lower bound for the logarithmic rate function than the Lagrangian dual transform, and that this tighter bound, when combined with the quadratic transform, produces a surrogate-enhanced fractional programming algorithm whose iterates achieve higher weighted sum rates than the classical fractional programming method while retaining per-cell separability and closed-form updates for scheduling decisions and transmit powers.","pith_inferences":["The same RIT construction could be tested on downlink power control or beamforming problems that also rely on log-rate minorization.","If the tightness gain persists in larger networks, the method might reduce the number of outer iterations needed for convergence.","The per-cell separability suggests straightforward parallel implementation across cells in a distributed setting."],"forward_implications":["The SEFP algorithm retains per-cell separability of the optimization problem.","All auxiliary variables, scheduling decisions, and transmit powers admit closed-form updates at each iteration.","The method applies to different network utilities while preserving the same algorithmic structure.","The approach extends the classical FP framework without sacrificing its computational advantages."],"fun_headline_variants":["RIT tightens first-order lower bound for logarithmic rate","SEFP outperforms classical FP for multicell uplink WSR","Reciprocal-inversion transform refines FP surrogate bound","New RIT yields tighter bound than Lagrangian dual transform"],"cache_read_input_tokens":64,"weakest_assumption_plain":"The reciprocal-inversion transform produces a strictly tighter first-order Taylor lower bound than the Lagrangian dual transform for the logarithmic rate function, and this tightness translates into measurably better optimization outcomes.","fun_headline_variants_meta":{"raw":{"variants":["RIT tightens first-order lower bound for logarithmic rate","SEFP outperforms classical FP for multicell uplink WSR","Reciprocal-inversion transform refines FP surrogate bound","New RIT yields tighter bound than Lagrangian dual transform"]},"model":"grok-4.3","cost_usd":0.005132,"raw_usage":{"total_tokens":2517,"prompt_tokens":713,"num_sources_used":0,"completion_tokens":63,"cost_in_usd_ticks":51324500,"prompt_tokens_details":{"text_tokens":713,"audio_tokens":0,"image_tokens":0,"cached_tokens":256},"completion_tokens_details":{"audio_tokens":0,"reasoning_tokens":1741,"accepted_prediction_tokens":0,"rejected_prediction_tokens":0}},"tokens_in":713,"tokens_out":63,"duration_ms":13104,"temperature":1.0,"reasoning_tokens":1741,"cache_read_input_tokens":256,"cache_creation_input_tokens":0},"cache_creation_input_tokens":0},"created_at":"2026-07-03T08:09:27.076418+00:00","model_set":{"reader":"grok-4.3"},"falsifier":"Run the SEFP and classical FP algorithms on the same multicell network instances with identical utility weights; if the weighted sum rates achieved by SEFP are never higher than those of classical FP across repeated trials, the claim that the RIT yields a practically superior surrogate would be falsified.","supporting_citations":[],"review_version":1}