{"id":"9e0313c5-cfe1-4dc4-bcb4-f2279edebb5c","arxiv_id":"1908.03202","paper_version":5,"verdict":"CONDITIONAL","confidence":"MODERATE","novelty_score":4.0,"correctness_risk":"medium","formal_verification":"none","parameter_count":3,"one_line_summary":"A robust semidefinite programming estimator with an anchor-aware rounding algorithm is proposed for RSS-based source localization under bounded anchor position errors.","lead":"This paper proposes a robust method for locating a wireless source from signal strength measurements when the known positions of the anchor nodes have bounded errors. It converts the problem into a semidefinite program and adds a rounding step that also adjusts for anchor position uncertainty.","discovery_kind":"new_method","skeptic_critique":{"model":"deepseek-v4-flash","headline":"The claimed robust-ML derivation changes the objective at Eqs. (12)-(13) and Eq. (25) contains a sign/dimension error, so the SDP whose RMSE is reported may not be the estimator the paper announces; without code/data the central claim is not verifiable.","rationale":"The reader's weakest assumption correctly targets the unannounced objective change from Eqs. (12) to (13) and the first-order Taylor expansion in Eq. (9). My reading confirms that this is the most load-bearing issue: the paper's headline is an empirical claim about an SDP-based estimator, but the derivation connecting the robust ML problem to the SDP is not valid as written. I additionally checked Eq. (25) and found a concrete sign inconsistency in the first constraint and a dimension typo for X, which makes the ambiguity worse: without code one cannot determine which estimator produced the RMSE curves. This does not necessarily mean the method is useless; it may work as a Chebyshev-style robust heuristic, and the simulations are internally plausible. But the failure of the derivation to connect to the announced ML estimator, combined with the absence of code, data, or the promised real experiment, means the strongest claim is not currently verifiable. The reader's CONDITIONAL verdict is therefore appropriate: the gap is repairable with a corrected derivation and released code, but the paper as presented does not substantiate the claim that the estimator solves the robust ML problem it states.","tokens_in":15984,"tokens_out":6966,"duration_ms":78533,"concrete_test":"Implement Eq. (8)'s robust ML objective directly for a small case (M=3, sigma=0, zeta in {0.06, 0.1, 0.16}, both anchor deployments) by evaluating the worst-case objective over delta_i on a fine grid plus local refinement, and compare its minimizer and objective value with the solution of Eq. (25) as printed and with the corrected-sign version. If the printed SDP is infeasible or its solution is far from the robust ML optimum, or if the corrected-sign SDP changes the r-r RMSE in Fig. 3(a) by more than 10%, then the reported performance is not evidence for the announced robust ML estimator. A second confirmation would be to rerun Fig. 3(a) with code for both sign versions and report the sensitivity.","verdict_should_be":"UNCHANGED","load_bearing_attack":"The central claim is that Robust-RSS plus rounding algorithm Alg. 4 gives the lowest RMSE under anchor uncertainty and RSS noise. The load-bearing question is whether the SDP actually solved, and the RMSE curves reported, correspond to the robust ML estimator announced in Eq. (8). Two concrete problems undermine that link. First, Eq. (8) minimizes, over x, the worst-case sum over anchors of squared log-ratio residuals: min_x max_{|delta_i|<=zeta} sum_i (log10((||x-hat z_i||-delta_i)^2/beta_i^2))^2. Eq. (13) replaces the sum over i by a max over i and the square by an absolute value, i.e. an l_infinity objective. That is a different estimator: a Chebyshev fit rather than an ML fit. No argument is given that the two objectives have the same minimizer or even comparable risk, so the abstract's phrase 'maximum likelihood estimator' is not supported. Second, the Taylor expansion in Eq. (9) drops o(||Delta_i||) and replaces the full vector uncertainty by a scalar delta_i bounded by zeta. Even granting that first-order surrogate, Eq. (25) is not a faithful transcription of it: the first constraint uses tr(X) + 2x^T hat z_i + hat z_i^T hat z_i + 2 zeta l_i + zeta^2, while Eq. (18)-(20) give ||x-hat z_i||^2 = tr(X) - 2x^T hat z_i + hat z_i^T hat z_i. Thus Eq. (25) constrains ||x + hat z_i||^2 up to the rounding terms, not the intended squared distance. The stated X in R^{M x M} also conflicts with X = xx^T in R^2. If the simulations used the printed signs, they solved a different, likely wrong problem; if they used the corrected signs, the manuscript's central SDP is mis-specified. Since no code or data are supplied and the promised real experiment is absent, the reported r-r advantage cannot be checked against the actual formulation. The concern is not that the heuristic is necessarily bad, but that the paper's central claim is attached to an estimator that is ambiguously and inconsistently derived.","agreement_with_reader":"agree"},"referee_report":{"model":"deepseek-v4-flash","summary":"The manuscript studies RSS-based source localization when anchor positions are known only up to a bounded error norm ζ. Starting from a log-normal path-loss model, the authors propose a min-max ('robust ML') estimator, transform it by Taylor expansion into a scalar radial uncertainty model, relax the resulting nonconvex problem to an SDP by dropping rank-one constraints, and develop three rounding schemes, including one that also refines anchor candidate positions. Simulations under random and planned anchor deployments compare the proposed Robust-RSS estimators with existing SDP, SOCP, distance-based, and ML methods. The paper claims that the proposed estimator with anchor-aware rounding (r-r) achieves the lowest RMSE under anchor position uncertainty and RSS measurement noise.","tokens_in":16433,"tokens_out":9637,"duration_ms":97588,"significance":"If correct, the paper would provide a practical contribution: an SDP-based RSS localization method that requires no distributional assumption on anchor errors and that can be solved efficiently with standard SDP solvers. The paper also contains useful practical discussion of numerical scaling and of why RSS-based methods degrade under anchor error. The strongest asset is the explicit worst-case formulation and the attempt to use RSS consistency in rounding. However, the derivation contains objective substitutions and sign/dimension inconsistencies that make the solved problem not exactly the announced estimator, and no code or data is provided. The significance is therefore conditional on correcting these technical issues.","major_comments":[{"comment":"Eq. (11) defines the robust estimator as min_x max_{|δ_i|≤ζ} ∑_{i=1}^M ( log10( (||x−ẑ_i||−δ_i)^2 / β_i^2 ) )^2. Eq. (13) is min_x max_i | log10( (||x−ẑ_i||−δ_i)^2 / β_i^2 ) |, which replaces the sum over anchors with a maximum over anchors and drops the square; this is a Chebyshev (l∞) fit, not the ML estimator announced in Eq. (8). The text says only that the l∞-norm is used 'to facilitate the design of a convex estimator,' but no argument is given that the two objectives share a minimizer or have comparable risk. Since every subsequent constraint and all simulation results inherit Eq. (13), the abstract's 'maximum likelihood estimator' claim is not supported. Either supply a proof or justification, or re-label the estimator as a robust Chebyshev/minimax estimator throughout.","section":"3.2, Eqs. (11)-(13)"},{"comment":"There is a sign error relative to Eq. (18). Eq. (18) gives ||x−ẑ_i||^2 = tr(X) − 2x^T ẑ_i + ẑ_i^T ẑ_i. The constraints in Eqs. (22) and (25) use tr(X) + 2x^T ẑ_i + ẑ_i^T ẑ_i ± 2ζ l_i + ζ^2. As printed, these constraints bound quantities involving ||x + ẑ_i||^2, not the intended squared distance to the inaccurate anchor. If the simulations used the printed signs, the reported RMSE is for a different SDP. In addition, Eq. (25) states X∈R^{M×M} while Eqs. (19) and (23) require X = xx^T ∈ S^2; the Schur complement (X x; x^T 1) is only well-formed for X∈S^2. These corrections are essential before the numerical results can be interpreted.","section":"3.2, Eqs. (22) and (25)"},{"comment":"The paper drops X = xx^T and L = ll^T with no analysis of the relaxation gap. The rounding algorithms depend on X* − x*x*^T being a meaningful covariance/error ellipsoid, and the 'ro' baseline is claimed to be the relaxed solution of Eq. (16); neither is justified without evidence on tightness. Please report the ranks of X* and L* and the objective gap, or provide a theoretical tightness argument. If the relaxation is loose, explain how the rounding algorithms compensate, since otherwise the reported gains from rounding are not explained.","section":"3.2, rank-one relaxation"},{"comment":"All numerical results are generated from the same log-normal model (Eq. (1)) used in the derivation, so the experiments test self-consistency but not robustness to model mismatch. The Introduction announces real experiment results in 'Section V,' but the manuscript contains no real experiment. Either include real measurements or delete that claim and temper statements about practical deployment. This matters because the paper's title and conclusions emphasize robustness under anchor uncertainty.","section":"4, validation"}],"minor_comments":[{"comment":"The while condition 'whileds =||xo− x∗||)≤ 3σd do' is malformed; it should state a proper loop condition involving ds and the distance to x*.","section":"3.3, Alg. 3"},{"comment":"The symbol L is overloaded: Eq. (20) uses L = ll^T, while Alg. 4 uses L for the RSS vector; β_i^2 and k also appear with inconsistent subscripts in Eqs. (28)-(30).","section":"Notation throughout"},{"comment":"The captions' abbreviated label mapping is inconsistent (e.g., 'M,S,D,O,P,R,G,N' includes 'ml' twice and does not match the legend order).","section":"Figs. 4 and 6"},{"comment":"The notation p←(M N) for M-permutations of N and the complexity of enumerating all combinations is not discussed; the choice of N and tt is left unspecified.","section":"3.3, Alg. 4"},{"comment":"The Introduction states that Section V will present numerical and real experiment results, but the experiments are in Section IV and no real results are reported; renumber and correct.","section":"1, organization"},{"comment":"Equation (28) contains stray text ('...,M' and missing parentheses) that makes the SOCP-RSS constraints ambiguous.","section":"4, Eq. (28)"}],"recommendation":"major_revision","confidential_remarks":"The manuscript is a methods paper whose central numerical claim cannot be checked against the printed equations because of the sign/dimension issues and the objective substitution in Eqs. (11)-(13). I would ask the authors to correct the SDP, rerun the simulations, and provide code or detailed reproducible settings. The absence of real experiments is not by itself fatal, but the announced 'real experiment results' must be resolved."},"author_rebuttal":null,"desk_editor":{"model":"deepseek-v4-flash","letter":"Quick take: the paper has a plausible core idea, but the derivation does not support the estimator it announces, and the sign error in the main SDP means the reported simulations may not be solving the stated problem.\n\nWhat is actually new: the bounded-error min-max formulation for RSS localization with unknown anchor positions, and the rounding algorithm (Alg. 4) that searches over candidate anchor positions and source positions together. That rounding idea is a reasonable extension of the usual randomization/grid-search rounding, and selecting the best combination by fitting the measured RSS vector is sensible. The paper also does the standard empirical work well: it sweeps anchor error bound, noise variance, and number of anchors; it separates random and planned anchor layouts; and it includes boxplots. The related work is broad and the writing is readable.\n\nSoft spots, in order of importance. First, Eqs. (12) to (13) quietly replace the sum over anchors of squared log-ratios with a max over anchors of absolute log-ratios. That is a different estimator—a Chebyshev-type fit rather than the announced ML fit. No argument is given that the two objectives share a minimizer or comparable behavior, so the abstract's phrase \"maximum likelihood estimator\" is not supported. Second, Eq. (25) has signs that do not match Eq. (18): the first constraint uses tr(X) + 2x^T z_i with a plus, while ||x - z_i||^2 = tr(X) - 2x^T z_i + z_i^T z_i with a minus. The printed SDP constrains ||x + z_i||^2 up to rounding terms. Also X is stated in R^{M x M} after being defined in R^2. If the simulations used the printed signs, they solved a different, likely wrong problem; if they used corrected signs, the manuscript is mis-specified. No code or data are provided to disambiguate. Third, the abstract and introduction promise a real experiment, but the full text stops at simulations. Fourth, the closest robust-RSS baselines, especially [22] and [29], are cited but not compared numerically, so the \"outperforms all\" claim is under-supported.\n\nThe simulation study is internally consistent, but it validates the method on data generated from the same log-normal model used to derive it; that is common for method papers and not damning by itself, but it makes the missing code and data more important. The core heuristic could still work; the problem is that the link between the announced estimator and the actual SDP is broken on the page.\n\nWho will get value: researchers working on RSS localization and convex relaxations. If the derivation is corrected and code released, the rounding algorithm and bounded-error formulation would be worth citing. As it stands, I would not rely on the numerical claims, but the paper is serious and the issues are repairable. A serious referee should see it. Recommendation: send to peer review with major revision required—correct the derivation, release code and data, either run the promised real experiment or remove the claim, and compare directly with robust RSS baselines.","headline":"The paper's core rounding idea is worth attention, but the derivation changes the estimator mid-stream and the main SDP has a sign error, so the reported simulation results cannot be tied to the stated method without code or a corrected formulation.","tokens_in":17004,"tokens_out":2757,"would_cite":false,"duration_ms":30764,"reading_group":"maybe","serious_thinker":"yes","would_accept_peer_review":true},"rs_alignment":null,"lean_confirmation":null,"pith_extraction":{"msc":[],"pacs":[],"model":"deepseek-v4-flash","headline":"The paper proposes an RSS-based source localization method that stays accurate when anchor positions are only known within a bound, using a worst-case semidefinite relaxation and joint source-and-anchor rounding.","keywords":["RSS localization","anchor position uncertainty","robust estimation","min-max optimization","semidefinite programming","rounding algorithm","worst-case design","received signal strength"],"falsifier":"Run a dense grid search over a small two-dimensional configuration with noiseless RSS, known anchor error bound $\\zeta$, and anchor positions that satisfy $\\|x-\\hat z_i\\|>\\zeta$; compare the global minimum of the original sum-of-squared log-ratio objective (Eq. (8)) with the output of the SDP plus rounding. If for some geometry the rounded SDP solution lies farther from the true source than the grid's best point by more than the grid resolution, the relaxation demonstrably solves a different problem than the announced robust estimator.","tokens_in":15773,"feed_emoji":"📡","tokens_out":10313,"duration_ms":100417,"temperature":0.7,"pith_summary":"Received-signal-strength (RSS) localization usually assumes the anchor nodes' positions are exact, but real deployments often have only roughly surveyed anchors. This paper tries to close that gap with an estimator that treats each anchor error as bounded by $\\zeta$ and assumes nothing else about its distribution. The authors derive a worst-case, min-max approximation of the maximum-likelihood objective, relax it into a semidefinite program (a convex optimization problem over matrix variables) that is solvable without a starting point, and add a rounding algorithm that searches candidate source locations and candidate anchor locations together. In Monte Carlo simulations with both random and planned anchor layouts, the combined method achieves the lowest root-mean-square error among the compared RSS, SOCP, and distance-based estimators across anchor error, measurement noise, and anchor count. If the claim holds, a practical system can localize accurately with imperfect anchor positions and no knowledge of the anchor error distribution.","feed_headline":"RSS localization stays accurate even when anchors are mislocated","feed_subtitle":"A min-max SDP plus joint rounding gives the lowest error among compared methods without knowing anchor error statistics.","key_machinery":"The load-bearing object is the min-max reformulation of the RSS objective: replace the original sum of squared log-ratio terms by $\\max_i \\left|\\log_{10}\\left((\\|x-\\hat z_i\\|-\\delta_i)^2/\\beta_i^2\\right)\\right|$ after a first-order Taylor expansion of the anchor error. This makes the worst case over anchor perturbations reduce to a known bound $\\zeta$ on $\\delta_i$, so the nonconvex problem becomes a semidefinite program with variables $x$, scalar $k$, distance vector $l$, and matrices $X=xx^T$, $L=ll^T$ relaxed to convex matrix constraints. The second mechanism is the joint rounding algorithm: it uses $X^* - x^* x^{*T}$ as a covariance to sample source candidates and uniformly samples anchor candidates inside each $\\zeta$-ball, selecting the pair with the lowest RSS residual. The combination is what converts a loose convex relaxation into a usable point estimate.","core_discovery":"The central claim is that inaccurate anchor positions need not be modeled statistically for robust RSS source localization: a bounded worst-case model suffices. The paper starts from the log-normal shadowing model, writes the maximum-likelihood estimate as minimizing the sum of squared log-ratio terms, then Taylor-expands the anchor perturbation (Eq. (9)) and converts the sum into a max over anchors of absolute log-ratios (Eq. (13)). This converts the uncertainty set into an additive bound $\\pm\\zeta$ on each distance ratio, allowing a semidefinite relaxation (Eq. (25)) with linear matrix inequality constraints. The final step is a rounding algorithm that samples candidate source positions from the relaxed covariance and candidate anchors uniformly inside each error ball, then picks the combination whose simulated RSS residuals are smallest. The paper's simulations report this 'r-r' pipeline as the best performer in root-mean-square error among all compared methods.","pith_inferences":["The same worst-case relaxation could be extended to unknown path-loss parameters or transmit power, since the paper notes propagation-parameter self-estimation as future work; the $\\zeta$-ball treatment of anchor error is a template for other bounded model errors.","The joint rounding algorithm could be repurposed as an anchor-calibration tool: when the source position is known, the selected candidate anchors form a corrected anchor map, a use the paper does not explore.","Because the method replaces the sum-of-squares ML objective with an $\\ell^\\infty$ (max) objective, it likely trades statistical efficiency for robustness; comparing full minimax SDP estimates against the $\\ell^\\infty$ version on the same data would quantify that trade.","The uniform sampling of anchor candidates inside the $\\zeta$-ball means accuracy should improve as more candidate anchors per anchor are drawn; a testable extension is to measure RMSE as a function of the sample count $N$ to find the point of diminishing returns."],"forward_implications":["Field deployments can relax the requirement of precisely surveyed anchors: a conservative bound $\\zeta$ on anchor error is enough to run the estimator.","Since the SDP relaxation is convex, the method needs no initialization, removing the local-minimum dependence that makes the ML baseline impractical.","The relaxation also yields a covariance-type uncertainty measure $X^* - x^* x^{*T}$, so the estimator can report a rough confidence region along with the point estimate.","The joint rounding over source and anchor candidates is what recovers accuracy under random anchor layouts; planned layouts already give a low error before rounding because the source tends to lie inside the region enclosed by the anchors (the convex hull).","Across the simulated range of anchor error, measurement noise, and anchor count, the combined pipeline is reported to have the smallest RMSE and the narrowest error distribution among the compared methods."],"supporting_citations":[{"why":"supplies the min-max worst-case estimation and SDP relaxation approach that the paper adapts from distance-based to RSS-based localization.","marker":"[21]"},{"why":"established a robust SDP estimator for RSS-based localization with anchor location errors, the direct precursor this method builds on.","marker":"[22]"},{"why":"is the SDP-RSS baseline labeled 'rss' that the proposed estimator is compared against.","marker":"[36]"},{"why":"is the modified ML estimator baseline whose sensitivity to initialization the convex method avoids.","marker":"[35]"},{"why":"is the SOCP-RSS baseline labeled 'so' used in the comparisons.","marker":"[15]"},{"why":"provides the SOCP relaxation baseline for distance-based localization used as 'so-d'.","marker":"[20]"},{"why":"supplies the rank-one approximation and rounding idea that motivates the paper's rounding discussion.","marker":"[32]"}],"fun_headline_variants":["RSS localization robust to mislocated anchors via min-max SDP","Bounded anchor error suffices for accurate RSS localization","Min-max SDP plus rounding handles anchor position uncertainty","RSS source localization without precise anchor coordinates","Worst-case anchor error model yields lowest RMSE in RSS localization"],"cache_read_input_tokens":3200,"weakest_assumption_plain":"The method stands on the assumption that the first-order Taylor expansion of anchor error plus the switch to a max-over-anchors absolute log-ratio objective leaves the optimum close enough to the original robust maximum-likelihood estimate that the relaxed problem still solves the localization task.","fun_headline_variants_meta":{"raw":{"variants":["RSS localization robust to mislocated anchors via min-max SDP","Bounded anchor error suffices for accurate RSS localization","Min-max SDP plus rounding handles anchor position uncertainty","RSS source localization without precise anchor coordinates","Worst-case anchor error model yields lowest RMSE in RSS localization"]},"model":"deepseek-v4-flash","effort":"low","cost_usd":0.000468,"raw_usage":{"total_tokens":2270,"prompt_tokens":822,"completion_tokens":1448,"prompt_tokens_details":{"cached_tokens":384},"prompt_cache_hit_tokens":384,"prompt_cache_miss_tokens":438,"completion_tokens_details":{"reasoning_tokens":1368}},"tokens_in":438,"tokens_out":1448,"duration_ms":10798,"temperature":1.0,"reasoning_tokens":1368,"cache_read_input_tokens":384,"cache_creation_input_tokens":0},"cache_creation_input_tokens":0},"created_at":"2026-08-14T14:18:40.534418+00:00","model_set":{"reader":"deepseek-v4-flash"},"falsifier":"Run a dense grid search over a small two-dimensional configuration with noiseless RSS, known anchor error bound $\\zeta$, and anchor positions that satisfy $\\|x-\\hat z_i\\|>\\zeta$; compare the global minimum of the original sum-of-squared log-ratio objective (Eq. (8)) with the output of the SDP plus rounding. If for some geometry the rounded SDP solution lies farther from the true source than the grid's best point by more than the grid resolution, the relaxation demonstrably solves a different problem than the announced robust estimator.","supporting_citations":[{"cited_title":"Robust relative location estimation in wireless sensor networks with inexact position problems,","cited_arxiv_id":null,"evidence_quote":"supplies the min-max worst-case estimation and SDP relaxation approach that the paper adapts from distance-based to RSS-based localization."},{"cited_title":"Robust differential received signal strength- based localization,","cited_arxiv_id":null,"evidence_quote":"established a robust SDP estimator for RSS-based localization with anchor location errors, the direct precursor this method builds on."},{"cited_title":"Received Signal Strength-Based Wireless Localization via Semidefinite Programming: Noncooper- ative and Cooperative Schemes,","cited_arxiv_id":null,"evidence_quote":"is the SDP-RSS baseline labeled 'rss' that the proposed estimator is compared against."},{"cited_title":"Relative location estimation in wireless sensor networks,","cited_arxiv_id":null,"evidence_quote":"is the modified ML estimator baseline whose sensitivity to initialization the convex method avoids."},{"cited_title":"Second-order cone relaxation for tdoa-based localization under mixed los/nlos condi- tions,","cited_arxiv_id":null,"evidence_quote":"is the SOCP-RSS baseline labeled 'so' used in the comparisons."},{"cited_title":"Second-order cone programming relaxation of sensor network localization,","cited_arxiv_id":null,"evidence_quote":"provides the SOCP relaxation baseline for distance-based localization used as 'so-d'."},{"cited_title":"Rank-one semidefinite programming solutions for mobile source localization in sensor networks,","cited_arxiv_id":null,"evidence_quote":"supplies the rank-one approximation and rounding idea that motivates the paper's rounding discussion."}],"review_version":1}