digitado

:::info Astounding Stories of Super-Science May 2001, by Astounding Stories is part of HackerNoon’s Book Blog Post series. You can jump to any chapter in this book here. A ROOM WITH A VIEW – Chapter VIII – Medieval Astounding Stories of Super-Science May 2001: A ROOM WITH A VIEW – Chapter VIII – Medieval By E. M. Forster ::: The drawing-room curtains at Windy Corner had been pulled to meet, for the carpet was new and deserved protection from […]

Ver mais

Good enough until it isn’t: the database complacency trap A database is like a water heater. When all is well, it just does its job in the background. You don’t fantasize about replacing it or envy the one your friend just got. Really, you don’t even think about it — until something goes awry. But new research reveals a key difference: With databases, the problems don’t blindside you. Some 38% of technology leaders worry that their current database […]

Ver mais

submitted by /u/StayingUp4AFeeling [link] [comments]

Ver mais

arXiv:2605.23268v1 Announce Type: new Abstract: In many prediction problems, we have extra information during training (for example, measurements that are expensive or slow to collect) that will not be available when the model is deployed. A common strategy is to first train a model that uses all training information, then use its predictions on unlabeled examples to train a second model that only uses the inputs available at test time. However, when the extra training-only information is weak […]

Ver mais

arXiv:2605.23145v1 Announce Type: new Abstract: Individual fairness, the notion that “similar individuals should be treated similarly,” provides a strong and flexible fairness guarantee for algorithmic decision makers. However, a barrier to implementing individual fairness in practice is the difficulty of learning the similarity metric over individuals. In this work, we present an algorithm for learning a Mahalanobis similarity metric from triplet queries of the form “is individual $i$ more similar to individual $j$ or $k$?” We work in […]

Ver mais

arXiv:2605.23102v1 Announce Type: new Abstract: Large language models (LLMs) offer a scalable mechanism to elicit domain-informed prior information for high-dimensional variable selection. However, existing methods such as LLM-Lasso are sensitive to weight quality, with performance degrading substantially when LLM-generated weights are inaccurate. To address this challenge, we first introduce a framework for quantifying the quality of LLM-generated weights, enabling rigorous evaluation of LLM-informed methods across varying weight regimes. We then propose the LLM Sparsity Prior (LSP), which integrates […]

Ver mais

arXiv:2605.23082v1 Announce Type: new Abstract: Survival analysis aims to model how covariates and time jointly shape the time-to-event distribution under right censoring. Classical methods such as the Cox model and generalised additive models (GAMs) require interactions and time-varying effects to be manually specified, which is increasingly impractical on rich clinical datasets. We introduce KAPLAN-HR, a B-spline Kolmogorov-Arnold Network (KAN) for nonparametric estimation of the conditional hazard as a joint function of covariates and time. A single-layer KAPLAN-HR model […]

Ver mais

arXiv:2605.22950v1 Announce Type: new Abstract: Score matching is an alternative to maximum likelihood estimation when the normalizing constant is unknown or too costly to evaluate. However, vanilla score matching has shown to be inefficient relative to maximum likelihood estimation for multimodal distributions with well-separated modes, which are commonly encountered in practical applications. We compare a novel diffusion-based denoising score matching estimator (DDSME) to the vanilla score matching estimator (SME) in this scenario. In particular, we prove statistical guarantees […]

Ver mais