# Diameter

Published articles for Diameter.

This is one page of public article previews, not the complete archive. Follow Next page to continue. Summaries are not the original full articles.

## Improving LLM Final Representations with Inter-Layer Geometry

DevFeed: [Improving LLM Final Representations with Inter-Layer Geometry](<https://devfeed.tech/articles/improving-llm-final-representations-with-inter-layer-geometry-143245.md>)

Original publisher: [Read original article](<https://arxiv.org/abs/2603.22665>)

Author: Tom Ulanovski, Eyal Blyachman, Maya Bechler-Speicher

Published: 2026-11-19T05:00:00Z

Content type: article

Language: en

Sources: [arXiv: Machine Learning](<https://devfeed.tech/sources/arxiv-machine-learning.md>)

Topics: [Large Language Model](<https://devfeed.tech/topics/llm.md>), [Machine learning](<https://devfeed.tech/topics/machine-learning.md>), [Representation learning](<https://devfeed.tech/topics/representation-learning.md>), [graph theory](<https://devfeed.tech/topics/graph-theory.md>), [few-shot](<https://devfeed.tech/topics/few-shot.md>), [Fine-tuning](<https://devfeed.tech/topics/fine-tuning.md>), [lora](<https://devfeed.tech/topics/lora.md>)

Tags: [cs-cl](<https://devfeed.tech/tags/cs-cl.md>), [cs-lg](<https://devfeed.tech/tags/cs-lg.md>), [diameter](<https://devfeed.tech/tags/diameter.md>), [efficiency](<https://devfeed.tech/tags/efficiency.md>), [encoder](<https://devfeed.tech/tags/encoder.md>), [explainability](<https://devfeed.tech/tags/explainability.md>), [few-shot](<https://devfeed.tech/tags/few-shot.md>), [fully-connected](<https://devfeed.tech/tags/fully-connected.md>), [gnn](<https://devfeed.tech/tags/gnn.md>), [intermediate](<https://devfeed.tech/tags/intermediate.md>), [layers](<https://devfeed.tech/tags/layers.md>), [llm](<https://devfeed.tech/tags/llm.md>), [lora](<https://devfeed.tech/tags/lora.md>), [multiple](<https://devfeed.tech/tags/multiple.md>), [overfitting](<https://devfeed.tech/tags/overfitting.md>), [performance](<https://devfeed.tech/tags/performance.md>), [topology](<https://devfeed.tech/tags/topology.md>)

### AI overview

Using intermediate LLM layers can improve downstream prediction over relying only on the final-layer representation. The work first applies a lightweight GNN over a fully connected graph of layers, then introduces Cayley-Encoder, which uses a sparse, regular, low-diameter Cayley graph over SL(2, Zn) to make aggregation more efficient and constrain its structure. Across 13 tasks and 13 LLMs, Cayley-Encoder reportedly outperforms baselines, with accuracy gains up to 48 percentage points and added parameters capped at 0.1% of LLM size. The abstract also reports effectiveness in few-shot settings and better performance than LoRA fine-tuning while keeping the LLM frozen. Its explainability analysis finds meaningful contributions from multiple layers. These are abstract-level claims; the supplied material gives no task-specific results or experimental details.

### Source excerpt

arXiv:2603.22665v4 Announce Type: replace-cross Abstract: The standard in LLM-based prediction is to use the final-layer representation as the input to a downstream predictor. However, intermediate layers may encode complementary task-relevant signals. Existing approaches therefore either search for the best layer for each task or apply expensive attention-based mechanisms to learn inter-layer aggregation. In this work, we first show that such complexity is unnecessary: a lightweight Graph Neural Network over a fully connected graph of LLM layers is more efficient and achieves significantly stronger predictive performance than existing approaches. We then introduce the Cayley-Encoder, which further improves both efficiency and predictive performance by replacing the fully connected graph with a Cayley graph over SL(2, Zn). These Cayley graphs provide a mathematically grounded topology that is sparse, regular by construction, and has low diameter. This enables effective communication across layers while constraining the aggregation structure and reducing the risk of GNN overfitting. In an evaluation of Cayley-Encoder across 13 tasks and 13 LLMs, Cayley-Encoder consistently outperforms baselines, achieving improvements of up to 48 percentage points in accuracy, while introducing at most 0.1% additional parameters relative to the LLM size. We further show that Cayley-Encoder is effective in few-shot regimes. Finally, we show that Cayley-Encoder outperforms LoRA fine-tuning while operating on the frozen LLM. We conclude with an explainability analysis showing that multiple layers contribute meaningfully to the final prediction, supporting our hypothesis.

## Bellman Residual Bracketing: Resolving the Sample Complexity of Discounted and Average-Reward RL

DevFeed: [Bellman Residual Bracketing: Resolving the Sample Complexity of Discounted and Average-Reward RL](<https://devfeed.tech/articles/bellman-residual-bracketing-resolving-the-sample-complexity-of-discounted-and-average-reward-rl-138889.md>)

Original publisher: [Read original article](<https://arxiv.org/abs/2611.19566>)

Author: Matthew Zurek, Yudong Chen

Published: 2026-11-17T05:00:00Z

Content type: article

Language: en

Sources: [arXiv: Machine Learning](<https://devfeed.tech/sources/arxiv-machine-learning.md>)

Topics: [Reinforcement learning](<https://devfeed.tech/topics/reinforcement-learning.md>), [computational complexity](<https://devfeed.tech/topics/computational-complexity.md>)

Tags: [2](<https://devfeed.tech/tags/2.md>), [3](<https://devfeed.tech/tags/3.md>), [abstract](<https://devfeed.tech/tags/abstract.md>), [approach](<https://devfeed.tech/tags/approach.md>), [arxiv](<https://devfeed.tech/tags/arxiv.md>), [based](<https://devfeed.tech/tags/based.md>), [bias](<https://devfeed.tech/tags/bias.md>), [classes](<https://devfeed.tech/tags/classes.md>), [complexity](<https://devfeed.tech/tags/complexity.md>), [contribution](<https://devfeed.tech/tags/contribution.md>), [cs-it](<https://devfeed.tech/tags/cs-it.md>), [cs-lg](<https://devfeed.tech/tags/cs-lg.md>), [d](<https://devfeed.tech/tags/d.md>), [delta](<https://devfeed.tech/tags/delta.md>), [diameter](<https://devfeed.tech/tags/diameter.md>), [discount](<https://devfeed.tech/tags/discount.md>), [efficiency](<https://devfeed.tech/tags/efficiency.md>), [factor](<https://devfeed.tech/tags/factor.md>), [failure](<https://devfeed.tech/tags/failure.md>), [math-it](<https://devfeed.tech/tags/math-it.md>), [math-oc](<https://devfeed.tech/tags/math-oc.md>), [math-pr](<https://devfeed.tech/tags/math-pr.md>), [reward](<https://devfeed.tech/tags/reward.md>), [rl](<https://devfeed.tech/tags/rl.md>), [sample](<https://devfeed.tech/tags/sample.md>), [stat-ml](<https://devfeed.tech/tags/stat-ml.md>)

### AI overview

For RL with a nonadaptive generative model, the paper reports plug-in sample bounds that, together with its lower bounds, resolve minimax complexity up to constant factors. In discounted RL, the bound is O(SA(1−γ)⁻³ε⁻² log(SA/δ)). In average-reward RL, discounted plug-in has bound O(SAHε⁻² log(SA/δ)), where H upper-bounds optimal bias span; direct undiscounted plug-in has O(SADε⁻² log(SA/δ)), where D is the diameter. The stated technical contribution is Bellman residual bracketing, which improves the efficiency of prior absorbing-MDP-based concentration analyses.

### Source excerpt

arXiv:2611.19566v1 Announce Type: new Abstract: We study the sample complexity of the empirical planning or plug-in approach for reinforcement learning (RL) with a generative model. We show the discounted plug-in approach finds an $\varepsilon$-optimal policy with $O(SA (1-\gamma)^{-3} \varepsilon^{-2} \log(SA/\delta))$ samples, where $S, A, \gamma, \delta$ are the state and action sizes, discount factor, and failure probability, respectively. In the average-reward setting, we show that discounted plug-in and direct (undiscounted) plug-in achieve $O(SAH\varepsilon^{-2}\log(SA/\delta))$ and $O(SAD\varepsilon^{-2}\log(SA/\delta))$ complexities, respectively, where $H$ upper-bounds the optimal bias span and $D$ is the diameter. Combining with our lower bounds for nonadaptive generative models, these results resolve the minimax sample complexity of discounted RL and average-reward RL --- in both the span- and diameter-based classes --- up to constant factors. Our main technical contribution is a novel Bellman residual bracketing technique which improves the efficiency of prior absorbing-MDP-based concentration analyses.

## Sharp First-Hit Identification from Finite Depth Samples

DevFeed: [Sharp First-Hit Identification from Finite Depth Samples](<https://devfeed.tech/articles/sharp-first-hit-identification-from-finite-depth-samples-138888.md>)

Original publisher: [Read original article](<https://arxiv.org/abs/2611.19563>)

Author: Hamidreza Hasani Balyani, Mahtab Movahhedrad, Seyed Pouyan Mousavi Davoudi

Published: 2026-11-17T05:00:00Z

Content type: article

Language: en

Sources: [arXiv: Machine Learning](<https://devfeed.tech/sources/arxiv-machine-learning.md>)

Topics: [3D](<https://devfeed.tech/topics/3d.md>), [Image](<https://devfeed.tech/topics/image.md>), [Algorithms](<https://devfeed.tech/topics/algorithms.md>)

Tags: [2](<https://devfeed.tech/tags/2.md>), [abstract](<https://devfeed.tech/tags/abstract.md>), [also](<https://devfeed.tech/tags/also.md>), [arxiv](<https://devfeed.tech/tags/arxiv.md>), [bounded](<https://devfeed.tech/tags/bounded.md>), [building](<https://devfeed.tech/tags/building.md>), [but](<https://devfeed.tech/tags/but.md>), [camera](<https://devfeed.tech/tags/camera.md>), [can](<https://devfeed.tech/tags/can.md>), [case](<https://devfeed.tech/tags/case.md>), [change](<https://devfeed.tech/tags/change.md>), [class](<https://devfeed.tech/tags/class.md>), [continuous](<https://devfeed.tech/tags/continuous.md>), [critical](<https://devfeed.tech/tags/critical.md>), [cs-cv](<https://devfeed.tech/tags/cs-cv.md>), [cs-lg](<https://devfeed.tech/tags/cs-lg.md>), [diameter](<https://devfeed.tech/tags/diameter.md>), [domain](<https://devfeed.tech/tags/domain.md>), [evaluation](<https://devfeed.tech/tags/evaluation.md>), [first](<https://devfeed.tech/tags/first.md>), [hit](<https://devfeed.tech/tags/hit.md>), [sharp](<https://devfeed.tech/tags/sharp.md>)

### AI overview

The paper characterizes exactly which first-hit depths are possible in a new camera view, given interval depth measurements, a known camera pose, and a bounded Lipschitz class of continuous inverse-depth fields. It constructs an admissible scene for each attainable depth; the possible set can be disconnected, and a shared-scene test handles multiple proposed first hits. In a rectified model with bL<1, the sharp worst-case inverse-depth diameter is max{Lh+2ε, 2ε/(1−bL)}, when depth and domain ranges suffice. At bL=1, exact samples retain the sharp Lh bound, but any positive measurement uncertainty can destroy uniform stability; above the threshold, ambiguity need not vanish with denser sampling. A frozen ten-scene evaluation distinguishes solver correctness under the assumptions from whether observations satisfy them: fixed learned-depth bands often produce narrow but incorrect sets. The results describe guarantees of the specified scene class, not physical-scene regularity inferred from samples.

### Source excerpt

arXiv:2611.19563v1 Announce Type: new Abstract: Which depths in a new camera view are determined by finitely many source-depth measurements? Pointwise uncertainty bounds do not answer this question: unobserved geometry between samples can change which surface is encountered first. We study a bounded Lipschitz class of continuous source inverse-depth fields with interval observations and known camera pose. Building on classical Lipschitz envelopes, we characterize the exact set of attainable first-hit depths and construct a globally admissible scene for every value in that set. The set can be disconnected. We also give a necessary and sufficient test for several proposed depths to be first hits of one shared scene. An epipolar reduction uses scalar cone inequalities without enumerating surfaces. In a rectified model with source spacing $h$, interval half-width $\varepsilon$, baseline $b$, and slope bound $L$, we prove a sharp worst-case inverse-depth diameter of $\max\{Lh+2\varepsilon,2\varepsilon/(1-bL)\}$ when $bL<1$, subject to sufficient depth and domain range for attainment. Exact samples still give the sharp bound $Lh$ at $bL=1$, while above this threshold ambiguity need not vanish as sampling becomes arbitrarily dense. Any positive measurement uncertainty can destroy uniform stability at the critical threshold. We provide constructive examples, an exact rational validation oracle, and a frozen ten-scene evaluation using reference, stereo, and learned-depth observations. The experiments separate solver correctness under the scene assumptions from failure of those assumptions: fixed learned-depth bands often yield narrow but incorrect sets. The results identify what a specified scene class permits; they do not infer a continuum regularity or physical-scene guarantee from sampled predictions.

## TotalSegmentator Aorta Report: Automated Aortic Diameter Measurement at 11 Standardized Landmarks on CT Images

DevFeed: [TotalSegmentator Aorta Report: Automated Aortic Diameter Measurement at 11 Standardized Landmarks on CT Images](<https://devfeed.tech/articles/totalsegmentator-aorta-report-automated-aortic-diameter-measurement-at-11-standardized-landmarks-on-ct-images-135157.md>)

Original publisher: [Read original article](<https://arxiv.org/abs/2611.17968>)

Author: Jakob Wasserthal, Daniel Hinck, Martin Segeroth, Joshy Cyriac, Denis Berdajs, Jules Miazza, Maurice Pradella

Published: 2026-11-16T05:00:00Z

Content type: article

Language: en

Sources: [arXiv: Artificial Intelligence](<https://devfeed.tech/sources/arxiv-artificial-intelligence.md>)

Topics: [Image](<https://devfeed.tech/topics/image.md>), [Tool](<https://devfeed.tech/topics/tool.md>)

Tags: [automated](<https://devfeed.tech/tags/automated.md>), [automatic](<https://devfeed.tech/tags/automatic.md>), [code](<https://devfeed.tech/tags/code.md>), [cs-ai](<https://devfeed.tech/tags/cs-ai.md>), [diameter](<https://devfeed.tech/tags/diameter.md>), [ecg](<https://devfeed.tech/tags/ecg.md>), [error](<https://devfeed.tech/tags/error.md>), [measurement](<https://devfeed.tech/tags/measurement.md>), [measurements](<https://devfeed.tech/tags/measurements.md>), [open-source](<https://devfeed.tech/tags/open-source.md>), [retrospective](<https://devfeed.tech/tags/retrospective.md>), [root](<https://devfeed.tech/tags/root.md>), [standard](<https://devfeed.tech/tags/standard.md>), [study](<https://devfeed.tech/tags/study.md>), [tool](<https://devfeed.tech/tags/tool.md>)

### AI overview

The open-source TotalSegmentator tool automatically measures maximum aortic diameter at 11 standardized landmarks from the annulus to the bifurcation, using segmentations of aortic branches and vertebrae to locate them. In a retrospective single-center evaluation of 239 CT angiography exams, mean absolute error against radiologist-reviewed measurements was 1.06 mm; 86.6% of landmark differences were within 2 mm, with a small average overestimation of 0.45 mm. Measurements were least accurate at the sinuses of Valsalva (MAE 2.17 mm), and 1.2% of landmarks failed automatically. Larger errors were more common with mural thrombus. The abstract reports no significant examination-level MAE differences by pathology, atherosclerosis grade, or ECG gating. The evaluation is limited to one center and the described CT angiography cohort.

### Source excerpt

arXiv:2611.17968v1 Announce Type: new Abstract: Purpose: To develop and evaluate a fully automated, open-source tool that measures aortic diameters at 11 standardized landmarks from the aortic annulus to the bifurcation on any CT image, following current guideline recommendations. Materials and Methods: This retrospective single-center study included 239 arterial phase CT angiography examinations of 230 patients (median age, 65 years [range, 18-99 years]; 163 men) performed between April 2025 and October 2026 (209 electrocardiographically [ECG] gated). The tool locates landmarks from TotalSegmentator segmentations of aortic branches and vertebrae and measures the maximum diameter at each. A senior radiologist reviewed and, where needed, corrected the automated measurements to create the reference standard. Agreement was assessed with mean absolute error (MAE), bias, and differences greater than 2 mm. Results: Across all landmarks, MAE was 1.06 mm (95% CI: 0.91, 1.22), and 86.6% (95% CI: 84.4, 88.5) of differences were 2 mm or less. The tool measured slightly larger diameters (bias, 0.45 mm [95% CI: 0.34, 0.57]). The sinuses of Valsalva had the largest MAE (2.17 mm [95% CI: 1.59, 2.86]). For 1.2% of landmarks, the automatic measurement failed. Examination-level MAE did not differ significantly by pathology, atherosclerosis grade (P=.95), or ECG gating (P=.14). Examinations with mural thrombus more often had an MAE greater than 2 mm (50% [95% CI: 31, 69] vs 20%; P=.03). Conclusion: The tool measured aortic diameters at 11 landmarks along the entire aorta with an MAE of about 1 mm, below published interreader variability. Agreement was lower at the aortic root and with mural thrombus. Code availability: The tool is open source and freely available at https://github.com/wasserth/TotalSegmentator.

## A Stage-Wise Explainable Pipeline for Arteriolar-to-Venular Ratio Estimation and Retinopathy Screening

DevFeed: [A Stage-Wise Explainable Pipeline for Arteriolar-to-Venular Ratio Estimation and Retinopathy Screening](<https://devfeed.tech/articles/a-stage-wise-explainable-pipeline-for-arteriolar-to-venular-ratio-estimation-and-retinopathy-screening-128384.md>)

Original publisher: [Read original article](<https://arxiv.org/abs/2611.14013>)

Author: Sharan Sharmeela Karuppannan, Yoga Sri Varshan V, Subin Sahayam, Umarani Jayaraman

Published: 2026-11-11T05:00:00Z

Content type: article

Language: en

Sources: [arXiv: Artificial Intelligence](<https://devfeed.tech/sources/arxiv-artificial-intelligence.md>)

Topics: [Image processing](<https://devfeed.tech/topics/image-processing.md>), [Image](<https://devfeed.tech/topics/image.md>)

Tags: [ablation](<https://devfeed.tech/tags/ablation.md>), [aggregation](<https://devfeed.tech/tags/aggregation.md>), [arxiv](<https://devfeed.tech/tags/arxiv.md>), [avr](<https://devfeed.tech/tags/avr.md>), [biomarkers](<https://devfeed.tech/tags/biomarkers.md>), [boundary](<https://devfeed.tech/tags/boundary.md>), [calibre](<https://devfeed.tech/tags/calibre.md>), [comparison](<https://devfeed.tech/tags/comparison.md>), [cs-ai](<https://devfeed.tech/tags/cs-ai.md>), [cs-cv](<https://devfeed.tech/tags/cs-cv.md>), [decision](<https://devfeed.tech/tags/decision.md>), [diameter](<https://devfeed.tech/tags/diameter.md>), [disease](<https://devfeed.tech/tags/disease.md>), [effects](<https://devfeed.tech/tags/effects.md>), [errors](<https://devfeed.tech/tags/errors.md>), [framework](<https://devfeed.tech/tags/framework.md>), [health](<https://devfeed.tech/tags/health.md>), [images](<https://devfeed.tech/tags/images.md>), [independent](<https://devfeed.tech/tags/independent.md>), [pipeline](<https://devfeed.tech/tags/pipeline.md>), [ratio](<https://devfeed.tech/tags/ratio.md>), [stage](<https://devfeed.tech/tags/stage.md>)

### AI overview

The five-stage pipeline estimates retinal arteriolar-to-venular ratio (AVR) from fundus images and applies an explicit threshold rule for exploratory retinopathy screening. It combines vessel and artery-vein masks, optic-disc localization, calibre estimation by a minimal-chord boundary walk, and AVR calculation from dominant arterial and venular branches. Inspectable intermediate outputs are intended to help trace errors to individual stages. On 30 HRF images, the authors report 96.7% accuracy, 0.968 F1, and 0.978 ROC-AUC; ablations and an exploratory comparison with VascX examine vessel pairing, calibre measurement, and aggregation. These results are limited by the small cohort, proxy disease labels, and lack of independent reference calibre measurements; validation on larger, clinically graded cohorts is needed.

### Source excerpt

arXiv:2611.14013v1 Announce Type: cross Abstract: The arteriolar-to-venular diameter ratio (AVR) is a clinically motivated marker of retinal vascular health. We present a five-stage pipeline for AVR estimation and exploratory retinopathy screening from fundus images, with inspectable intermediate outputs at each stage. The pipeline combines vessel and artery-vein masks, optic-disc localization, vessel-calibre estimation using a minimal-chord boundary walk, and AVR computation from dominant arterial and venular branches. An explicit threshold-based rule produces the screening decision, enabling errors to be traced to individual processing stages. On an exploratory cohort of 30 HRF images, we report 96.7% accuracy, an F1-score of 0.968 and ROC-AUC of 0.978. Ablation studies and an exploratory comparison with VascX examine the effects of vessel pairing, calibre measurement and aggregation. Interpretation is limited by the small cohort, proxy disease labels and absence of independent reference calibre measurements. The pipeline provides a transparent framework for investigating retinal vascular biomarkers, with further validation needed on larger, clinically graded cohorts.

## Near-Optimal Sample Complexity of Deterministic Agnostic PAC Learning

DevFeed: [Near-Optimal Sample Complexity of Deterministic Agnostic PAC Learning](<https://devfeed.tech/articles/near-optimal-sample-complexity-of-deterministic-agnostic-pac-learning-128672.md>)

Original publisher: [Read original article](<https://arxiv.org/abs/2611.13210>)

Author: Shai Ben-David, Steve Hanneke, Farnam Mansouri, Amirreza Shaeiri

Published: 2026-11-11T05:00:00Z

Content type: article

Language: en

Sources: [arXiv: Machine Learning](<https://devfeed.tech/sources/arxiv-machine-learning.md>)

Topics: [Machine learning](<https://devfeed.tech/topics/machine-learning.md>), [concept-learning](<https://devfeed.tech/topics/concept-learning.md>), [computational complexity](<https://devfeed.tech/topics/computational-complexity.md>)

Tags: [algorithms](<https://devfeed.tech/tags/algorithms.md>), [class](<https://devfeed.tech/tags/class.md>), [classes](<https://devfeed.tech/tags/classes.md>), [complexity](<https://devfeed.tech/tags/complexity.md>), [cs-lg](<https://devfeed.tech/tags/cs-lg.md>), [diameter](<https://devfeed.tech/tags/diameter.md>), [dimension](<https://devfeed.tech/tags/dimension.md>), [examples](<https://devfeed.tech/tags/examples.md>), [function](<https://devfeed.tech/tags/function.md>), [learning](<https://devfeed.tech/tags/learning.md>), [learning-algorithms](<https://devfeed.tech/tags/learning-algorithms.md>), [lower-bounds](<https://devfeed.tech/tags/lower-bounds.md>), [machine-learning](<https://devfeed.tech/tags/machine-learning.md>), [minimax](<https://devfeed.tech/tags/minimax.md>), [online](<https://devfeed.tech/tags/online.md>), [pac-learning](<https://devfeed.tech/tags/pac-learning.md>), [sample](<https://devfeed.tech/tags/sample.md>), [stat-ml](<https://devfeed.tech/tags/stat-ml.md>), [statistics](<https://devfeed.tech/tags/statistics.md>), [vc](<https://devfeed.tech/tags/vc.md>), [vc-dimension](<https://devfeed.tech/tags/vc-dimension.md>)

### AI overview

For deterministic labels that may fall outside the concept class, the paper proves a sample-complexity bound of Õ(K^(1/3)d^(2/3)/ε) for classes with VC dimension d and finite diameter K, tight up to logarithmic factors for constructed classes. This improves on the prior Õ(K/ε) upper bound and the classical O(d/ε²) agnostic guarantee in the setting described. The paper also finds that minimax regret in the online analogue is partly controlled by class diameter. Its upper bounds use memorization-based algorithms that exploit deterministic labels.

### Source excerpt

arXiv:2611.13210v1 Announce Type: cross Abstract: We study the problem of agnostic PAC learning under deterministic labels, where the examples are labeled by an arbitrary deterministic function, which need not belong to the concept class $C$. This model captures misspecification without stochastic label noise and lies between the realizable and fully agnostic settings. Prior work showed that, when $C$ has finite diameter $K$ and VC dimension $d$, deterministic labels can improve the sample complexity upper bound from the classical agnostic guarantee $O(d/\varepsilon^2)$ to $\widetilde{O}(K/\varepsilon)$, but left a large gap between upper and lower bounds. Our main result sharpens this picture. We prove that every class of VC dimension $d$ and finite diameter $K$ is learnable with sample complexity $\widetilde{O}\left( \frac{K^{1/3} \, d^{2/3}}{\varepsilon} \right)$, and we construct classes for which this bound is tight up to logarithmic factors. We also study the online analogue of this problem and show that the minimax regret is again partly controlled by the diameter of the class. Technically, our upper bounds are obtained via memorization-based learning algorithms that exploit the deterministic label structure.

## Community Search under Member-Specific Tolerances

DevFeed: [Community Search under Member-Specific Tolerances](<https://devfeed.tech/articles/community-search-under-member-specific-tolerances-118119.md>)

Original publisher: [Read original article](<https://arxiv.org/abs/2611.05951>)

Author: Yanghao Liu, Fangda Guo, Yuxuan Zhang, Xueqi Cheng

Published: 2026-11-05T05:00:00Z

Content type: article

Language: en

Sources: [arXiv: Databases](<https://devfeed.tech/sources/arxiv-databases.md>)

Topics: [graph theory](<https://devfeed.tech/topics/graph-theory.md>), [Combinatorial optimization](<https://devfeed.tech/topics/combinatorial-optimization.md>), [Distributed Systems & Parallel Computing](<https://devfeed.tech/topics/distributed-systems-parallel-computing.md>)

Tags: [acceptance](<https://devfeed.tech/tags/acceptance.md>), [algorithm](<https://devfeed.tech/tags/algorithm.md>), [approximation](<https://devfeed.tech/tags/approximation.md>), [communities](<https://devfeed.tech/tags/communities.md>), [community](<https://devfeed.tech/tags/community.md>), [confidence](<https://devfeed.tech/tags/confidence.md>), [core](<https://devfeed.tech/tags/core.md>), [cs-cc](<https://devfeed.tech/tags/cs-cc.md>), [cs-db](<https://devfeed.tech/tags/cs-db.md>), [cs-si](<https://devfeed.tech/tags/cs-si.md>), [diameter](<https://devfeed.tech/tags/diameter.md>), [dimension](<https://devfeed.tech/tags/dimension.md>), [efficiency](<https://devfeed.tech/tags/efficiency.md>), [graphs](<https://devfeed.tech/tags/graphs.md>), [groups](<https://devfeed.tech/tags/groups.md>), [homes](<https://devfeed.tech/tags/homes.md>), [influence](<https://devfeed.tech/tags/influence.md>), [location](<https://devfeed.tech/tags/location.md>), [location-based](<https://devfeed.tech/tags/location-based.md>), [networks](<https://devfeed.tech/tags/networks.md>), [np](<https://devfeed.tech/tags/np.md>), [np-hard](<https://devfeed.tech/tags/np-hard.md>), [search](<https://devfeed.tech/tags/search.md>)

### AI overview

A latitude-consistent community (LCC) is a connected group containing a query vertex, with minimum degree at least k and diameter no greater than the smallest tolerance among its members. In a closed group, this bound exactly characterizes persistent acceptance of all interactions under bounded-confidence dynamics with arbitrary positive weights, and prevents rejection under social-judgment dynamics; natural relaxations guarantee neither. Finding a maximum LCC is NP-hard even in the plane, while existence is NP-complete for fixed k >= 2 in unbounded dimension. LatSweep uses a sweep over the smallest tolerance to produce two feasible heuristics, a (1,2)-bicriteria approximation and an exact branch-and-bound solver. Across eight graphs, the solver proved optimality on all but 9 of 3,700 efficiency queries and outperformed the listed comparison methods in queries proved. The reported applications also find that outside ties can invalidate the guarantee, and tolerance-agnostic groups in two location networks often exceed members' estimated travel radii; enforcing tolerances showed no detected co-visit loss against same-size spatial communities.

### Source excerpt

arXiv:2611.05951v1 Announce Type: cross Abstract: We study community search when each vertex has its own tolerance for differences in position. For positions such as opinions or homes, a latitude-consistent community (LCC) contains the query vertex, is connected, has minimum degree at least k, and bounds its diameter by the smallest member tolerance. Motivated by social judgment theory, the bound exactly characterizes persistent acceptance of every interaction in a closed group under bounded-confidence dynamics with arbitrary positive weights. It also prevents rejection under social-judgment dynamics, whereas natural relaxations preserve neither guarantee. Finding a maximum LCC is NP-hard even in the plane, and with unbounded dimension, deciding whether an LCC exists is NP-complete for every fixed k >= 2. LatSweep turns the coupled bound into a sweep over the smallest tolerance, yielding two feasible heuristics, a (1,2)-bicriteria approximation and an exact branch-and-bound algorithm. Across eight graphs with up to 1.8 billion edges, the exact algorithm proves optimality on all but 9 of 3,700 efficiency queries and usually certifies absence within microseconds when no LCC exists. Its branch-and-bound solver proves more queries than a reimplemented maximum-(k,r)-core algorithm, a mixed-integer program and CP-SAT. In simulations, uneven influence disrupts initially accepted interactions in pairwise groups. Outside ties invalidate the guarantee for many real groups. On two location-based networks, tolerance-agnostic groups often place another member's home beyond a member's estimated travel radius; comparisons with spatial communities of the same size detect no co-visit loss from enforcing every member's tolerance.

## Microdroplet Generator Surrogate Enhancement and Inverse Design Through an Uncertainty-Guided Framework

DevFeed: [Microdroplet Generator Surrogate Enhancement and Inverse Design Through an Uncertainty-Guided Framework](<https://devfeed.tech/articles/microdroplet-generator-surrogate-enhancement-and-inverse-design-through-an-uncertainty-guided-framework-118471.md>)

Original publisher: [Read original article](<https://arxiv.org/abs/2611.06464>)

Author: David Gabriel Harispe, Mat\\'ias Gerard, Pablo A. Kler

Published: 2026-11-05T05:00:00Z

Content type: article

Language: en

Sources: [arXiv: Artificial Intelligence](<https://devfeed.tech/sources/arxiv-artificial-intelligence.md>)

Topics: [Simulation and Design](<https://devfeed.tech/topics/simulation-and-design.md>), [Complex Systems](<https://devfeed.tech/topics/complex-systems.md>)

Tags: [adaptive](<https://devfeed.tech/tags/adaptive.md>), [applications](<https://devfeed.tech/tags/applications.md>), [balancing](<https://devfeed.tech/tags/balancing.md>), [cases](<https://devfeed.tech/tags/cases.md>), [class](<https://devfeed.tech/tags/class.md>), [classification](<https://devfeed.tech/tags/classification.md>), [confidence](<https://devfeed.tech/tags/confidence.md>), [consensus](<https://devfeed.tech/tags/consensus.md>), [consistency](<https://devfeed.tech/tags/consistency.md>), [costs](<https://devfeed.tech/tags/costs.md>), [cs-ai](<https://devfeed.tech/tags/cs-ai.md>), [data](<https://devfeed.tech/tags/data.md>), [datasets](<https://devfeed.tech/tags/datasets.md>), [design](<https://devfeed.tech/tags/design.md>), [device](<https://devfeed.tech/tags/device.md>), [diameter](<https://devfeed.tech/tags/diameter.md>), [enhancement](<https://devfeed.tech/tags/enhancement.md>), [framework](<https://devfeed.tech/tags/framework.md>), [generator](<https://devfeed.tech/tags/generator.md>), [inverse-design](<https://devfeed.tech/tags/inverse-design.md>), [physics-flu-dyn](<https://devfeed.tech/tags/physics-flu-dyn.md>), [uncertainty](<https://devfeed.tech/tags/uncertainty.md>)

### AI overview

The framework combines Volume-of-Fluid simulations with neural network ensembles to predict droplet flow regimes and diameters, then uses ensemble uncertainty to guide additional simulations. Uncertainty is concentrated near regime transition boundaries; targeted enrichment also addresses class imbalance before retraining the ensembles. For inverse design, Particle Swarm Optimization searches constrained configurations while accounting for prediction accuracy, confidence, and physical consistency. On independent test datasets, enrichment nearly doubled the share of diameter predictions within 0-3% error and substantially reduced cases above 10% error. The reported procedure found physically realizable configurations meeting target droplet sizes, while reducing computational costs.

### Source excerpt

arXiv:2611.06464v1 Announce Type: cross Abstract: Microfluidic droplet generation is critical for many applications, yet efficient device design in high-dimensional parameter spaces remains computationally prohibitive due to complex multiphase flow dynamics. This work presents a unified methodology that couples adaptive surrogate enhancement with simulation-driven inverse design. High-fidelity Volume-of-Fluid simulations provide ground-truth data, while neural network ensembles predict flow regimes and droplet diameters. Ensemble-based uncertainty quantification identifies epistemic uncertainty using consensus levels for regime classification and the coefficient of variation for diameter prediction, revealing that uncertainty concentrates near regime transition boundaries where physics is highly sensitive to parameter perturbations. A physics-informed enrichment strategy targets these critical zones and addresses class imbalances by deploying additional targeted simulations and retraining the surrogates forming the ensembles. A framework that integrates Particle Swarm Optimization for constrained inverse design, balancing accuracy with predictive confidence and physical consistency is therefore proposed. Validation on independent test datasets demonstrates that the enriched ensembles achieve higher accuracy, with the fraction of predictions within the 0-3% error range on droplet diameter nearly doubling, and high-error cases (above 10%) dropping substantially. The inverse design procedure reliably identifies physically realizable configurations meeting target droplet sizes. This approach significantly reduces computational costs while ensuring reliable predictions, offering a framework with potential applicability to the optimization of a broad range of microfluidic systems.

## Local Distributed Computation under Crash Failures

DevFeed: [Local Distributed Computation under Crash Failures](<https://devfeed.tech/articles/local-distributed-computation-under-crash-failures-116501.md>)

Original publisher: [Read original article](<https://arxiv.org/abs/2611.04898>)

Author: Diana Ghinea, Fabian Kuhn, Chen-Da Liu-Zhang, Zahra Parsaeian

Published: 2026-11-04T05:00:00Z

Content type: article

Language: en

Sources: [arXiv: Distributed Computing](<https://devfeed.tech/sources/arxiv-distributed-computing.md>)

Topics: [Algorithms](<https://devfeed.tech/topics/algorithms.md>), [graph theory](<https://devfeed.tech/topics/graph-theory.md>)

Tags: [2](<https://devfeed.tech/tags/2.md>), [3](<https://devfeed.tech/tags/3.md>), [abstract](<https://devfeed.tech/tags/abstract.md>), [algorithm](<https://devfeed.tech/tags/algorithm.md>), [algorithms](<https://devfeed.tech/tags/algorithms.md>), [all](<https://devfeed.tech/tags/all.md>), [also](<https://devfeed.tech/tags/also.md>), [arxiv](<https://devfeed.tech/tags/arxiv.md>), [can](<https://devfeed.tech/tags/can.md>), [complete](<https://devfeed.tech/tags/complete.md>), [complexity](<https://devfeed.tech/tags/complexity.md>), [crash](<https://devfeed.tech/tags/crash.md>), [crashes](<https://devfeed.tech/tags/crashes.md>), [cs-dc](<https://devfeed.tech/tags/cs-dc.md>), [cs-ds](<https://devfeed.tech/tags/cs-ds.md>), [delta](<https://devfeed.tech/tags/delta.md>), [diameter](<https://devfeed.tech/tags/diameter.md>), [distributed](<https://devfeed.tech/tags/distributed.md>), [f](<https://devfeed.tech/tags/f.md>), [failures](<https://devfeed.tech/tags/failures.md>), [local](<https://devfeed.tech/tags/local.md>), [under](<https://devfeed.tech/tags/under.md>)

### AI overview

The paper studies deterministic locally checkable graph algorithms in the synchronous LOCAL model, where crashed nodes may send messages to only some neighbors. It introduces consistent neighborhoods, which enable simulation of a T-round fault-free algorithm using radius R=T+ℓ+1 views, with constraints guaranteed where the radius-ℓ checking neighborhood has no crash. For maximum degree Δ>=3, the views can be built in O(min{n,(Δ−1)^R,RΔf}) rounds when a global crash bound f is known; the n and exponential bounds do not require knowing f. Degree-two graphs and graphs of girth greater than 2R admit O(R)-round construction. The bounds are tight in stated regimes, with lower bounds ranging from Ω(n) after one crash on some diameter-two graphs to Ω(ΔRf) under specified parameter conditions. For LCLs, fault-free O(log* n) complexity is preserved under any number of crashes when that bound holds on bounded-degree graphs, but a degree-five example rises from Θ(log n) to Θ(n). Sinkless orientation has a stronger result: any fault-free algorithm can tolerate arbitrary crashes with one extra round, including at surviving neighbors of crashes.

### Source excerpt

arXiv:2611.04898v1 Announce Type: new Abstract: We study deterministic algorithms for locally checkable graph problems in the synchronous LOCAL model with crash failures, where a crashing node may send messages to only some neighbors. We introduce consistent neighborhoods: partial radius-$R$ views that agree locally across surviving edges and are complete without crashes. For $R=T+\ell+1$, these views allow local simulation of $T$-round fault-free algorithms that remain correct on subgraphs, satisfying constraints wherever the radius-$\ell$ checking neighborhood contains no crash. On graphs with at most $n$ nodes and maximum degree at most $\Delta\geq3$, we construct these views in $O(\min\{n,(\Delta-1)^R,R\Delta f\})$ rounds when a crash bound $f\geq1$ is globally known; the first two bounds require no knowledge of $f$. For $\Delta=2$ or girth greater than $2R$, including forests, $O(R)$ rounds suffice. Our upper bounds are essentially tight in suitable parameter regimes. One crash can force $\Omega(n)$ rounds even for $R=3$ on diameter-two graphs. For each fixed $\Delta\geq3$ and sufficiently large $R$, we prove a $(\Delta-1)^{R-O(\sqrt R)}$ lower bound even with crashes restricted to round beginnings. We also prove an $\Omega(\Delta Rf)$ lower bound when $R\geq4\lceil\log_{\Delta-1}f\rceil+4$ and $n\geq\Delta Rf$. For locally checkable labeling (LCL) problems, we preserve $O(\log^* n)$ complexity under any number of crashes whenever this bound holds without faults on all graphs with a fixed degree bound. In contrast, we construct an LCL on graphs of maximum degree at most five with fault-free complexity $\Theta(\log n)$ and crash-tolerant complexity $\Theta(n)$. Finally, any fault-free sinkless-orientation algorithm can be transformed to tolerate any number of crashes with only one additional round, guaranteeing correctness even at surviving nodes adjacent to crashes.

## When Is Tracking Affordable? A Movement-Budget Feasibility Threshold for Dynamic Regret

DevFeed: [When Is Tracking Affordable? A Movement-Budget Feasibility Threshold for Dynamic Regret](<https://devfeed.tech/articles/when-is-tracking-affordable-a-movement-budget-feasibility-threshold-for-dynamic-regret-114740.md>)

Original publisher: [Read original article](<https://arxiv.org/abs/2611.02812>)

Author: Ridham Patel

Published: 2026-11-03T05:00:00Z

Content type: article

Language: en

Sources: [arXiv: Machine Learning](<https://devfeed.tech/sources/arxiv-machine-learning.md>)

Topics: [catboost](<https://devfeed.tech/topics/catboost.md>)

Tags: [adversary](<https://devfeed.tech/tags/adversary.md>), [algorithm](<https://devfeed.tech/tags/algorithm.md>), [arxiv](<https://devfeed.tech/tags/arxiv.md>), [budget](<https://devfeed.tech/tags/budget.md>), [construction](<https://devfeed.tech/tags/construction.md>), [convex](<https://devfeed.tech/tags/convex.md>), [cs-lg](<https://devfeed.tech/tags/cs-lg.md>), [cs-sy](<https://devfeed.tech/tags/cs-sy.md>), [diameter](<https://devfeed.tech/tags/diameter.md>), [domain](<https://devfeed.tech/tags/domain.md>), [eess-sy](<https://devfeed.tech/tags/eess-sy.md>), [environment](<https://devfeed.tech/tags/environment.md>), [experiments](<https://devfeed.tech/tags/experiments.md>), [gradient](<https://devfeed.tech/tags/gradient.md>), [gradient-descent](<https://devfeed.tech/tags/gradient-descent.md>), [learner](<https://devfeed.tech/tags/learner.md>), [linear](<https://devfeed.tech/tags/linear.md>), [machine-learning](<https://devfeed.tech/tags/machine-learning.md>), [math-oc](<https://devfeed.tech/tags/math-oc.md>), [minimax](<https://devfeed.tech/tags/minimax.md>), [moving](<https://devfeed.tech/tags/moving.md>), [online](<https://devfeed.tech/tags/online.md>), [stat-ml](<https://devfeed.tech/tags/stat-ml.md>), [tracking](<https://devfeed.tech/tags/tracking.md>)

### AI overview

A hard cap on an online learner's total movement can make tracking a moving comparator incur linear dynamic regret, even when the environment changes slowly. For convex losses on a domain of diameter D, a deterministic adversary forces regret Ω(GDT) when the movement budget S is at most a sufficiently small constant multiple of comparator path length P_T. By contrast, projected online gradient descent with a budget-aware step size achieves sublinear regret when S grows faster than D + P_T, in the learnable regime. The results distinguish the learner's travel forced by the comparator from the comparator's path length alone. Experiments support the predicted threshold and 1/S decay; the tight minimax rate above the threshold remains open.

### Source excerpt

arXiv:2611.02812v1 Announce Type: new Abstract: Dynamic regret measures an online learner against a moving comparator, and standard analyses assume the learner may move freely at every round. We study what happens when it may not: the learner is given a hard budget $S$ on its total movement $\sum_t \|x_t - x_{t-1}\|$. Our main result is that a movement budget creates a feasibility barrier. On a domain of diameter $D$ with $G$-Lipschitz convex losses, for every comparator path length $P_T \in [D, DT]$ we exhibit a deterministic adversary that forces $R_d = \Omega(GDT)$ on every budget-feasible algorithm whenever $S \le c P_T$ for a universal constant $c>0$. This barrier is caused by the budget rather than by a volatile environment: for fixed $D$, it applies when $P_T = o(T)$, where the unconstrained minimax rate $\Theta(G\sqrt{D(D+P_T)T})$ is sublinear, so the same instances are learnable with an unbounded budget and unlearnable without one. Conversely, projected online gradient descent with a budget-aware step size is budget-feasible and attains $o(GDT)$ once $S = \omega(D + P_T)$. Thus the critical movement scale is $D+P_T$: linear regret is unavoidable below a sufficiently small constant multiple of $P_T$, while sublinear regret is achievable when $S/(D+P_T)\to\infty$ in the learnable regime. The construction rests on a distinction we make explicit: what makes a comparator expensive to track under a movement budget is the distance it forces the learner to travel, not its path length. Above the threshold we give a budget-dependent upper bound and identify the tight minimax rate in this region as an open problem rather than claiming a product law. Experiments support the predicted transition location and the $1/S$ decay.

## SS7 and Diameter Attacks: How Signaling Flaws Expose Your Phone

DevFeed: [SS7 and Diameter Attacks: How Signaling Flaws Expose Your Phone](<https://devfeed.tech/articles/ss7-and-diameter-attacks-how-signaling-flaws-expose-your-phone-108391.md>)

Original publisher: [Read original article](<https://www.bleepingcomputer.com/news/security/ss7-and-diameter-attacks-how-signaling-flaws-expose-your-phone/>)

Author: Sponsored by Cape

Published: 2026-10-30T14:00:10Z

Content type: article

Language: en

Sources: [BleepingComputer](<https://devfeed.tech/sources/bleepingcomputer.md>)

Topics: [Cybersecurity](<https://devfeed.tech/topics/cybersecurity.md>), [Security](<https://devfeed.tech/topics/security.md>), [protocols](<https://devfeed.tech/topics/protocols.md>), [trust](<https://devfeed.tech/topics/trust.md>), [Security research](<https://devfeed.tech/topics/security-research.md>)

Tags: [2](<https://devfeed.tech/tags/2.md>), [2025](<https://devfeed.tech/tags/2025.md>), [2fa](<https://devfeed.tech/tags/2fa.md>), [3](<https://devfeed.tech/tags/3.md>), [4g](<https://devfeed.tech/tags/4g.md>), [5g](<https://devfeed.tech/tags/5g.md>), [attacks](<https://devfeed.tech/tags/attacks.md>), [can](<https://devfeed.tech/tags/can.md>), [cape](<https://devfeed.tech/tags/cape.md>), [cellular](<https://devfeed.tech/tags/cellular.md>), [computer-help](<https://devfeed.tech/tags/computer-help.md>), [computer-security](<https://devfeed.tech/tags/computer-security.md>), [computers](<https://devfeed.tech/tags/computers.md>), [cybersecurity](<https://devfeed.tech/tags/cybersecurity.md>), [diameter](<https://devfeed.tech/tags/diameter.md>), [infosec](<https://devfeed.tech/tags/infosec.md>), [linux](<https://devfeed.tech/tags/linux.md>), [mac](<https://devfeed.tech/tags/mac.md>), [malware](<https://devfeed.tech/tags/malware.md>), [malware-removal](<https://devfeed.tech/tags/malware-removal.md>), [mobile](<https://devfeed.tech/tags/mobile.md>), [networks](<https://devfeed.tech/tags/networks.md>), [phone](<https://devfeed.tech/tags/phone.md>), [protocols](<https://devfeed.tech/tags/protocols.md>), [security](<https://devfeed.tech/tags/security.md>), [service](<https://devfeed.tech/tags/service.md>), [signaling-system-7](<https://devfeed.tech/tags/signaling-system-7.md>), [sms](<https://devfeed.tech/tags/sms.md>), [spyware](<https://devfeed.tech/tags/spyware.md>), [ss7](<https://devfeed.tech/tags/ss7.md>), [support](<https://devfeed.tech/tags/support.md>), [tech-support](<https://devfeed.tech/tags/tech-support.md>), [technical-support](<https://devfeed.tech/tags/technical-support.md>), [trust](<https://devfeed.tech/tags/trust.md>), [verification](<https://devfeed.tech/tags/verification.md>), [virus](<https://devfeed.tech/tags/virus.md>), [virus-removal](<https://devfeed.tech/tags/virus-removal.md>), [windows](<https://devfeed.tech/tags/windows.md>)

### AI overview

SS7 and Diameter signaling weaknesses can let attackers track a subscriber, redirect calls and texts to intercept SMS codes, impersonate the subscriber, or disrupt service without accessing the phone. SS7 lacks machine-request authentication; Diameter offers stronger authentication but operators may omit protections and retain peer-to-peer trust. Firewalls and location-based velocity checks can miss plausible roaming claims because location updates may be hours old, and attackers can rotate operator identities or switch protocols. Cape describes four defenses: daily IMSI rotation, no SS7 support or fallback, Network Lock, which checks a foreign network's attach claim against the device at country level, and ongoing third-party penetration testing. The source says Network Lock reports whether a claim matches without collecting or storing precise location. The account is sponsored and written by Cape.

### Source excerpt

Flaws in SS7 and Diameter signaling protocols can allow attackers to track phone locations, intercept calls and SMS verification codes, and impersonate subscribers without compromising their devices. Cape explains how these attacks exploit trust between networks and how its security-focused mobile service helps defend against them. [...]

## Inter-Satellite Link Optimization for Low-Latency Global Networking

DevFeed: [Inter-Satellite Link Optimization for Low-Latency Global Networking](<https://devfeed.tech/articles/inter-satellite-link-optimization-for-low-latency-global-networking-107602.md>)

Original publisher: [Read original article](<https://arxiv.org/abs/2604.15528>)

Author: Arman Mollakhani, Jerayu Tiamraj, Shu-Jie Cao, Dongning Guo

Published: 2026-10-30T04:00:00Z

Content type: article

Language: en

Sources: [arXiv: Networking](<https://devfeed.tech/sources/arxiv-networking.md>)

Topics: [communications](<https://devfeed.tech/topics/communications.md>), [Latency](<https://devfeed.tech/topics/latency.md>), [graph theory](<https://devfeed.tech/topics/graph-theory.md>), [Combinatorial optimization](<https://devfeed.tech/topics/combinatorial-optimization.md>)

Tags: [connectivity](<https://devfeed.tech/tags/connectivity.md>), [convex](<https://devfeed.tech/tags/convex.md>), [cs-ni](<https://devfeed.tech/tags/cs-ni.md>), [delay](<https://devfeed.tech/tags/delay.md>), [diameter](<https://devfeed.tech/tags/diameter.md>), [global](<https://devfeed.tech/tags/global.md>), [latency](<https://devfeed.tech/tags/latency.md>), [link](<https://devfeed.tech/tags/link.md>), [low-latency](<https://devfeed.tech/tags/low-latency.md>), [network](<https://devfeed.tech/tags/network.md>), [networking](<https://devfeed.tech/tags/networking.md>), [optimization](<https://devfeed.tech/tags/optimization.md>), [orbit](<https://devfeed.tech/tags/orbit.md>), [satellite](<https://devfeed.tech/tags/satellite.md>), [selection](<https://devfeed.tech/tags/selection.md>), [shortest-path](<https://devfeed.tech/tags/shortest-path.md>), [simulations](<https://devfeed.tech/tags/simulations.md>), [topology](<https://devfeed.tech/tags/topology.md>)

### AI overview

The proposed two-stage method reduces inter-satellite network diameter by optimizing a convex relaxation that maximizes graph algebraic connectivity, then converting its fractional links into a feasible topology with maximum-weight b-matching. In Walker-Delta simulations, it achieves smaller diameters than local search and standard patterned topologies. For 1,584 satellites with four inter-satellite links each, up to 2,500 km long, the reported diameter is as low as 12 hops and maximum satellite-to-satellite propagation delay is about 90 ms. Including up- and downlinks totaling 8 ms yields up to about 98 ms user-to-user propagation delay, comparable to a great-circle fiber route between antipodal points. These are simulation results.

### Source excerpt

arXiv:2604.15528v2 Announce Type: replace Abstract: Large-scale low-Earth-orbit satellite constellations offer a promising platform for global low-latency networking, in part because signals propagate faster in free space than in fiber and copper. In such systems, end-to-end latency is largely determined by the inter-satellite link (ISL) topology. In particular, the network diameter--the longest shortest path, in hops, between any pair of satellites--serves as a key performance metric for time-sensitive applications. Designing diameter-optimal topologies is challenging due to node degree constraints, orbital dynamics, and the combinatorial nature of link selection. This paper proposes a two-stage optimization framework for ISL topology design. First, a continuous relaxation of the link-selection problem is formulated as a convex program that maximizes the algebraic connectivity of the graph Laplacian, serving as a tractable surrogate for diameter minimization. Second, the resulting fractional solution is mapped to a feasible topology via maximum-weight b-matching, a problem solvable in polynomial time. Simulations on Walker-Delta constellations show that the proposed method consistently achieves smaller network diameters than a local-search baseline and standard patterned topologies. For a 1,584-satellite constellation in which each satellite has four ISLs of up to 2,500 km, the diameter is as small as 12 hops, and the maximum propagation delay between any two satellites is about 90 ms. With up- and downlinks adding up to 8 ms, the user-to-user propagation delay is at most about 98 ms, comparable to the delay over a great-circle fiber route between antipodal points on Earth.

## An Exercise in Species Barcoding

DevFeed: [An Exercise in Species Barcoding](<https://devfeed.tech/articles/an-exercise-in-species-barcoding-40568.md>)

Original publisher: [Read original article](<http://norvig.com/ibol.html>)

Published: 2009-02-11T00:00:00Z

Content type: article

Language: en

Sources: [Peter Norvig](<https://devfeed.tech/sources/peter-norvig.md>)

Topics: [clustering](<https://devfeed.tech/topics/clustering.md>)

Tags: [algorithm](<https://devfeed.tech/tags/algorithm.md>), [australia](<https://devfeed.tech/tags/australia.md>), [butterflies](<https://devfeed.tech/tags/butterflies.md>), [clustering](<https://devfeed.tech/tags/clustering.md>), [clusters](<https://devfeed.tech/tags/clusters.md>), [collectors](<https://devfeed.tech/tags/collectors.md>), [data](<https://devfeed.tech/tags/data.md>), [diameter](<https://devfeed.tech/tags/diameter.md>), [dna](<https://devfeed.tech/tags/dna.md>), [dynamic-programming](<https://devfeed.tech/tags/dynamic-programming.md>), [edit-distance](<https://devfeed.tech/tags/edit-distance.md>)

### AI overview

The 1,248 Australian Lepidoptera barcodes (659 bases each; 801 distinct sequences) suggest genetic clusters but do not establish crisp species boundaries. To handle possible truncation, the author compared sequences with a Levenshtein distance that treats "N" and "-" as free matches and stops once distance reaches 4%; this reduced computation from an estimated week with a naive implementation. About 84% of barcodes had a nearest neighbor within four edits. Across tested clustering thresholds, results ranged from 375 to 390 clusters, with few clusters combining multiple collector labels; randomizing processing order had little effect. Some clusters were close to others under particular parameter settings, and many broad or coarse collector labels contained genetically diverse sequences. The author concludes that barcode distances can help explore groupings, while the observed variation and examples such as ring species underscore that species boundaries may not be sharp.

### Source excerpt

Just in time for Darwin's birthday: an exercise in analyzing the differences in genomes to detect the boundaries between species