The current source text is the original text and can be switched to the Chinese translation.
SaveShare
Overview
arXiv:2303.03538v2 Announce Type: replace-cross Abstract: Compact appliance classifiers can support local electricity-load monitoring where memory and computation are constrained. We evaluate adaptive sparse evolutionary training and warm-start compression using synthetic aggregate windows derived from household appliance recordings. A completed convolutional network study trains 120 models over four targets and three seeds with validation-only model selection. Two analyses examine compression with approximately preserved binary accuracy and joint improvement in positive-class F1 and sparsity. Relative to a newly trained fixed sparse evolutionary baseline, the selected compressed policy changes accuracy from 91.53%, while increasing macro F1 to 92.40%. Stored weights decrease by 17.36% and active first-layer connections by 23.93%. Refinement requires additional training. Three seeds and unverified source-window independence prevent claims of statistical equivalence or unseen-house performance.
arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website.
Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them.
Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs .
READ THE ORIGINAL
Read the original for the full context.
The content of this article comes from arXiv cs.NE,Copyright belongs to the original author and publisher.
arXiv:2610.30220v1 Announce Type: new Abstract: Learned representations of high-dimensional multimodal health records are increasingly used to adjust for confounding, yet they are usually trained to reconstruct the data rather than preserve the information that causal identification requires.
arXiv:2610.30465v1 Announce Type: new Abstract: Kernelized attention provides a useful perspective for understanding self-attention as a similarity-based aggregation mechanism, but existing approaches often rely on fixed or stationary kernels, limiting their ability to adapt the similarity structure to complex token interactions.
arXiv:2610.30196v1 Announce Type: new Abstract: We study $(\varepsilon,\delta)$-differentially private synthetic data for arbitrary databases of $n$ records in $[-1,1]^d$ under a specified integral probability metric (IPM). We introduce generalized moment matching, which estimates moments privately, fits a probability measure, and samples synthetic records. A general error theorem applies when moment error controls the target IPM.
Loading comments…