Model Detail
Sharp-Spark-X2.5-4B-GGUF
—Sharp-Spark-X2.5-4B-GGUF is a large language model with 4B parameters released by peculiar-ragdoll. The model is registered under the text-generation pipeline tag on Hugging Face, distributed under the permissive apache-2.0 license.
Sharp-Spark-X2.5-4B-GGUF ships with 4B parameters, distributed as a quantized weight variant for lower-VRAM inference. The apache-2.0 license is permissive, allowing commercial deployment and derivative work without per-seat fees, though attribution requirements still apply.
Sharp-Spark-X2.5-4B-GGUF is best fit for general-purpose chat and instruction-following workloads. Treat this as a starting matrix rather than a benchmark verdict — the right deployment usually depends on the specific evaluation suite that mirrors your workload.
Sharp Degree Bounds for Putinar Certificates in Terms of the Positivity Margin via Analytic Sums of Squares
arXiv:2610.26976v1 Announce Type: new Abstract: We establish sharp degree bounds for Putinar sum-of-squares (SOS) certificates in terms of the positivity margin $\delta$. For any fixed Archimedean quadratic module with prescribed generators and any fixed bound on the degree of the objective, we prov
Unified Sharp Bounds on Probabilities of Causation
arXiv:2610.27398v1 Announce Type: new Abstract: Probabilities of causation (PoCs) have developed steadily, from the binary measures first introduced by Pearl to the non-binary setting recently studied by Shu et al. As the theory has matured, PoCs have found applications in a growing range of areas,
Sharp Asymptotic Theory of Maximum Likelihood Estimation for Gaussian Processes with an RBF Kernel
arXiv:2610.10080v3 Announce Type: replace-cross Abstract: Gaussian processes (GPs) are widely used across machine learning, spatial statistics, time-series analysis, optimization, Bayesian statistics, and scientific applications. A central component of a GP model is its kernel, which is typically sp
Sharp and Stable Label-Free Calibration Certificates from Logical Coherence
arXiv:2610.21567v1 Announce Type: new Abstract: Query-conditioned probabilistic predictors answer logically related questions one at a time, and labels to check their calibration are often missing. For each restriction on what a bettor's stakes may use, a minimax theorem identifies, for finitely sup
Sharp Statistical Thresholds for Attributed Gaussian Graph Matching
arXiv:2603.23305v2 Announce Type: replace-cross Abstract: We investigate the problem of matching networks where both edge weights and node features are correlated following a specific node correspondence. While prior work has established sharp thresholds for matching either graphs or features indivi
The Sharp Directions Are Against You: Curvature Analysis of Activation Steering
arXiv:2610.16084v1 Announce Type: new Abstract: Activation steering adds a vector to a language model's internal representations at inference time. It is a lightweight alternative to fine-tuning for behavioral control. The standard construction, contrastive activation addition (CAA), is fragile, as
