{"id":"4ce3ca77-d9ca-44ef-b5c6-75e9ebf89b18","arxiv_id":"2606.22622","paper_version":1,"verdict":"UNVERDICTED","confidence":"LOW","novelty_score":5.0,"correctness_risk":"unknown","formal_verification":"none","parameter_count":0,"one_line_summary":"New algorithm for maximum likelihood approximation of bivariate finite-support distributions by TP2 distributions.","lead":"The paper proposes a new algorithm to approximate a given bivariate finite-support distribution by a totally positive of order 2 (TP2) distribution, optimized under maximum likelihood. A smart generalist might read it for advances in computational tools handling positive dependence structures in statistical data.","discovery_kind":"unclear","skeptic_critique":{"model":"grok-4.3","headline":"Whether the new algorithm guarantees global optimality for non-convex ML over the TP2 cone","rationale":"The reader's weakest assumption matches the load-bearing point exactly. Because the full manuscript is referenced but not reproduced here, the concrete test above is the minimal check that would decide whether the algorithmic claim survives the non-convexity issue.","tokens_in":1498,"tokens_out":274,"duration_ms":9287,"concrete_test":"For a 3x3 support size, enumerate all TP2 matrices (via the known characterization of TP2 matrices with fixed margins), compute their exact log-likelihood values under a fixed empirical measure, and run the proposed algorithm from multiple random starts; if any run fails to recover the enumerated global maximum, the convergence claim does not hold.","verdict_should_be":"CONDITIONAL","load_bearing_attack":"The central claim is the existence of a new algorithm that solves the maximum-likelihood TP2 approximation problem. This optimization is over the TP2 cone (a convex set) but the likelihood objective is typically non-convex in the probability mass entries. The reader's weakest assumption correctly isolates the missing guarantee: without an explicit global-convergence argument, a local method, or a convex reformulation, the procedure could return stationary points that are not globally optimal, rendering the approximation unreliable for the stated purpose.","agreement_with_reader":"agree"},"referee_report":{"model":"grok-4.3","summary":"The manuscript revisits the maximum-likelihood approximation of a bivariate finite-support distribution by a totally positive of order two (TP2) distribution and presents a new algorithm for solving this optimization problem over the TP2 cone.","tokens_in":1578,"tokens_out":214,"duration_ms":13814,"significance":"A reliable algorithm for this constrained approximation problem would be useful in statistical modeling of positive dependence structures. However, the absence of any derivation, convergence analysis, or empirical validation in the provided material prevents assessment of whether the claimed advance is substantive.","major_comments":[{"comment":"The central claim is the existence of a new algorithm that solves the ML problem over the TP2 cone. Because the likelihood is typically non-convex in the probability masses while the constraint set is convex, any local solver risks returning stationary points that are not globally optimal; no section supplies a global-convergence argument, convex reformulation, or exhaustive-search guarantee.","section":null}],"minor_comments":[],"recommendation":"uncertain","confidential_remarks":null},"author_rebuttal":{"model":"grok-4.3","summary":"We thank the referee for their report and the opportunity to respond. We address the major comment below.","responses":[{"response":"We agree that the likelihood is non-convex while the TP2 constraint set is convex, so the problem is non-convex and our algorithm is a local solver without a global convergence guarantee, convex reformulation, or exhaustive-search property. The manuscript does not claim global optimality. Its contribution is an efficient procedure for handling the TP2 constraints within an iterative scheme that yields good practical approximations, supported by the derivation of the update steps. We will revise the text to explicitly acknowledge the local character of the method and to discuss the non-convexity limitation.","revision_made":"yes","referee_comment":"The central claim is the existence of a new algorithm that solves the ML problem over the TP2 cone. Because the likelihood is typically non-convex in the probability masses while the constraint set is convex, any local solver risks returning stationary points that are not globally optimal; no section supplies a global-convergence argument, convex reformulation, or exhaustive-search guarantee."}],"tokens_in":992,"tokens_out":247,"duration_ms":16993,"standing_objections":[]},"desk_editor":{"model":"grok-4.3","letter":"The one thing to know is that this paper claims a new algorithm for the max-likelihood approximation of bivariate distributions by TP2 ones, but the abstract alone does not let us check if the algorithm is real or reliable.\n\nThey do a decent job of stating the problem in clear terms. The task is to find a TP2 distribution that maximizes the likelihood for approximating a given bivariate one with finite support. That framing is straightforward and matches what the reader highlighted as the strongest claim.\n\nWhat is new is the algorithm itself, according to the title and abstract. The paper positions it as a revisit with a new method. If the full text delivers a working procedure with some guarantee, that could be useful for people doing bivariate modeling where TP2 structure is desired.\n\nThe soft spots are obvious and central. There is no description of the algorithm, no mention of how it handles the likely non-convex optimization, no convergence analysis, and no empirical results. The stress-test note correctly flags the missing global optimality guarantee. For a non-convex problem over the TP2 cone, a local method could easily get stuck, and without evidence against that, the claim is unverified. The soundness score of 2.0 from the reader matches what the abstract shows.\n\nThis is for a narrow group of statisticians working on totally positive distributions or shape-constrained estimation. A reader outside that niche gets no value. It does not look like it deserves peer review yet because the central claim cannot be evaluated. I would not bring it to a reading group or cite it based on this.\n\nRecommendation: desk reject or ask for a revision with the actual method and tests before sending to referees.","headline":"The paper claims a new algorithm for max-likelihood TP2 approximation of bivariate distributions but the abstract supplies no method, analysis, or results to evaluate it.","tokens_in":2028,"tokens_out":418,"would_cite":false,"duration_ms":20084,"reading_group":"no","serious_thinker":"unclear","would_accept_peer_review":false},"rs_alignment":null,"lean_confirmation":null,"pith_extraction":{"msc":[],"pacs":[],"model":"grok-4.3","headline":"A new algorithm computes the maximum-likelihood TP2 approximation to any bivariate distribution with finite support.","keywords":["totally positive","TP2","maximum likelihood","approximation","bivariate distribution","algorithm","contingency table","statistical computing"],"falsifier":"Execute the algorithm on a 3-by-3 contingency table whose global TP2 maximizer can be enumerated by hand or by exhaustive search over the cone and check whether the output matches that known optimum.","tokens_in":2397,"feed_emoji":"","tokens_out":494,"duration_ms":21089,"temperature":0.7,"pith_summary":"The paper revisits the task of replacing a given bivariate discrete distribution with the closest TP2 distribution, where closeness is measured by maximum likelihood. TP2 distributions encode a strong form of positive dependence through the inequality p(i,j)p(k,l) >= p(i,l)p(k,j) for i < k and j < l. The authors supply an algorithm intended to solve this constrained optimization problem directly. A reader would care because the resulting approximation preserves monotone dependence while remaining computationally tractable for contingency-table data.","feed_headline":"New algorithm finds TP2 maximum-likelihood approximations","feed_subtitle":"It targets any bivariate finite-support distribution and solves the constrained optimization directly.","key_machinery":"An iterative procedure that projects onto the TP2 cone while ascending the likelihood surface.","core_discovery":"We introduce a new algorithm that finds the maximum-likelihood estimator inside the cone of totally positive distributions of order two with finite support.","pith_inferences":["The same iteration might be adapted to other cones defined by pairwise inequalities, such as those arising in shape-constrained estimation.","If the algorithm scales linearly with table size, it would make TP2 modeling routine for moderately large categorical datasets."],"forward_implications":["The fitted distribution satisfies all TP2 inequalities by construction.","The procedure yields a regularized estimate that automatically enforces positive quadrant dependence.","It applies directly to observed frequency tables without requiring external smoothing parameters."],"fun_headline_variants":["Algorithm finds TP2 maximum-likelihood approximations","Algorithm solves TP2 maximum-likelihood optimization","TP2 maximum-likelihood estimators via new algorithm","Computes maximum-likelihood TP2 approximations directly"],"cache_read_input_tokens":2112,"weakest_assumption_plain":"The non-convex maximum-likelihood problem over the TP2 cone admits an efficient, globally convergent algorithm that needs no post-processing or escape from poor local solutions.","fun_headline_variants_meta":{"raw":{"variants":["Algorithm finds TP2 maximum-likelihood approximations","Algorithm solves TP2 maximum-likelihood optimization","TP2 maximum-likelihood estimators via new algorithm","Computes maximum-likelihood TP2 approximations directly"]},"model":"grok-4.3","cost_usd":0.006986,"raw_usage":{"total_tokens":3099,"prompt_tokens":394,"num_sources_used":0,"completion_tokens":51,"cost_in_usd_ticks":69862000,"prompt_tokens_details":{"text_tokens":394,"audio_tokens":0,"image_tokens":0,"cached_tokens":256},"completion_tokens_details":{"audio_tokens":0,"reasoning_tokens":2654,"accepted_prediction_tokens":0,"rejected_prediction_tokens":0}},"tokens_in":394,"tokens_out":51,"duration_ms":20288,"temperature":1.0,"reasoning_tokens":2654,"cache_read_input_tokens":256,"cache_creation_input_tokens":0},"cache_creation_input_tokens":0},"created_at":"2026-06-26T09:11:30.428629+00:00","model_set":{"reader":"grok-4.3"},"falsifier":"Execute the algorithm on a 3-by-3 contingency table whose global TP2 maximizer can be enumerated by hand or by exhaustive search over the cone and check whether the output matches that known optimum.","supporting_citations":[],"review_version":1}