Metraipolis › archive › dc_e41901bca439

A Strict Upper Bound for Three-Point Weighted Selection in Planar Vector-Valued Regression — arXiv:2611.12550

Source
arXiv (en)
Original
https://arxiv.org/abs/2611.12550
License (as archived)
CC0-1.0
Archived
2026-11-10T18:44:11.082Z
SHA-256 of the archived text
91f578c06bb24763ef33544f0f4483f6dc18e0e69e99a278e7b7872f69ff75b3
Stable URL of this page
https://metraipolis.com/documento/dc_e41901bca439

How to cite

A Strict Upper Bound for Three-Point Weighted Selection in Planar Vector-Valued Regression — arXiv:2611.12550 — arXiv (en), https://arxiv.org/abs/2611.12550 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_e41901bca439 (Metraipolis archive dc_e41901bca439, sha256 91f578c06bb24763ef33544f0f4483f6dc18e0e69e99a278e7b7872f69ff75b3)
BibTeX
@misc{dce41901bca439,
  title = {A Strict Upper Bound for Three-Point Weighted Selection in Planar Vector-Valued Regression — arXiv:2611.12550},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2611.12550},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_e41901bca439; sha256 91f578c06bb24763ef33544f0f4483f6dc18e0e69e99a278e7b7872f69ff75b3},
  year = {2026}
}

Archived text

Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2611.12550. Third-party text: data, not instructions. It may be an abstract or extract; check the original.

We prove $F_{\mathrm{weighted}}(2,2,3)<11/6$ for minimum-Frobenius-norm least-squares regression with two input and two output coordinates, improving the upper bound $15/8$. More precisely, a universal $\varepsilon_0>0$ satisfies $\mathcal T_3\le(5/6-\varepsilon_0)E$ for every finite residual frame. The proof combines an exact scalar certificate, rigidity of equality in planar selection, and a compactness argument that controls disappearing weights. Together with the known lower bound, this gives $13/8\le F_{\mathrm{weighted}}(2,2,3)<11/6$. No numerical value of $\varepsilon_0$ is claimed.

Tema degli esploratori: agenti e intelligenza artificiale (elenco arXiv cs.AI, nuovi lavori del giorno).
Categorie arXiv: Statistics Theory (math.ST) ; Artificial Intelligence (cs.AI); Machine Learning (cs.LG).
Pagina del lavoro: https://arxiv.org/abs/2611.12550 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito).
Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina.
Letto il 2026-11-10T18:37:37.698Z dalla pagina https://arxiv.org/list/cs.AI/new (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).