PD-ML-Lite uses lightweight cryptography for private distributed machine learning.
problem Privacy issues in learning from distributed data.
method Applying lightweight cryptographic protocols to build learning algorithms.
result Achieves the same accuracy as non-private methods while maintaining privacy.
Post-quantum cryptography needed for blockchain security.
problem Quantum computers threaten traditional blockchain cryptography.
method Review of theoretical cryptography and quantum information theory.
result Post-quantum cryptography is essential for blockchain security.
Cryptographic schemes use Thurston norm from 3-manifold topology.
problem Creating secure cryptographic keys.
method Public-key and symmetric-key schemes based on Thurston norm.
result Cryptographic security from 3-manifold topology.
The paper proposes a privacy-preserving algorithm for decentralized learning using public-key cryptography.
problem Preserving data privacy in decentralized learning.
method Public-key cryptography and anonymization techniques.
result A scheme that provides anonymity in decentralized learning with theoretical guarantees.
Optimizes crypto-oriented neural architectures for faster secure inference.
problem Privacy conflicts between model users and providers in neural network applications.
method Proposes a novel Partial Activation layer to optimize the initial design of crypto-oriented neural architectures.
result Significant improvement in the efficiency of secure inference on common evaluation metrics.
Hard to estimate L2-accurate scores without strong assumptions.
problem Estimating the score of unknown data distributions accurately.
method Reduction to generating samples and leveraging lattice-based cryptography hardness.
result Score estimation is computationally hard even with polynomial sample complexity.
In this paper we consider several classical and novel algorithmic problems for right-angled Artin groups, some of which are closely related to graph theoretic problems, and study their computational complexity. We study these problems with a view towards applications to cryptography.
A new framework for lightweight BNNs learns heteroscedastic uncertainties efficiently.
problem Learning heteroscedastic uncertainties from BNNs for lightweight networks.
method Embedding heteroscedastic variances into BNN parameters and using moment propagation for inference.
result Improves predictive performance for lightweight BNNs without increasing parameter count.
DBQ quantizes lightweight networks efficiently for resource-constrained devices.
problem High computational and storage complexity of deep neural networks on resource-constrained devices.
method A differentiable non-uniform quantizer that can be mapped onto efficient ternary-based dot product engines.
result Achieves state-of-the-art results with minimal training overhead and best accuracy-complexity trade-off.
Machine learning, specifically LSTM, models quantum experiments efficiently.
problem Modeling complex quantum states with high-dimensional entanglement.
method Used a long short-term memory (LSTM) neural network to predict quantum experiment outcomes.
result LSTM neural networks can accurately predict quantum experiment outcomes without computing the states themselves.
RSAC improves lightweight continuous learning efficiency.
problem Excessive training time and memory usage in continuous learning.
method Regularized subspace approximation classifier with feature reduction and regularization.
result RSAC achieves more efficient continuous learning than prior methods.
DLC enhances distillation-based continual learning with lightweight plugins.
problem Stability-plasticity dilemma in distillation-based continual learning.
method DLC deploys lightweight residual plugins into the classifier-proximal layer of a shared feature extractor.
result Significant 8% accuracy gain on large-scale benchmarks with minimal parameter increase.
Safeguarding privacy in machine learning is highly desirable, especially in collaborative studies across many organizations. Privacy-preserving distributed machine learning (based on cryptography) is popular to solve the problem. However, existing cryptographic protocols still incur excess computational overhead. Here,…
iSTFTNet2 improves iSTFTNet's speed and lightness with 1D-2D CNN.
problem Efficiently synthesizing high-fidelity speech.
method Improved iSTFTNet using 1D-2D CNNs for temporal and spectrogram structures.
result iSTFTNet2 is faster and more lightweight with comparable speech quality.
Augment small datasets with synthetic backgrounds to train lightweight CNNs for human pose estimation.
problem Training CNNs from limited real-world data for human pose estimation.
method Synthetic background substitution for data augmentation.
result Improves generalization to unseen environments.
CMoS improves time series forecasting with minimal parameters.
problem Efficiently forecasting time series data with limited resources.
method CMoS directly models chunk-wise spatial correlations, using Correlation Mixing and Periodicity Injection techniques.
result CMoS outperforms state-of-the-art models with minimal parameters.
Federated learning framework improves model generalization and privacy.
problem Communication overhead and statistical heterogeneity in FL.
method Prototypes and lightweight adapters for local model refinement.
result Improves classification accuracy over baseline algorithms.
Mapper-GIN simplifies 3D point cloud classification with lightweight structure.
problem Robust 3D point cloud classification under corruption.
method Mapper algorithm for structural decomposition, GIN for graph classification.
result Mapper-GIN achieves competitive accuracy with minimal parameters.
Paper presents a lightweight, unobtrusive method to protect edge device data privacy.
problem Protecting inference data privacy in IoT edge devices with limited compute power.
method A lightweight neural network at edge devices to obfuscate inference data without indicating obfuscation.
result Effectively protects inference data confidentiality while preserving backend accuracy.
GIBLy adds geometric priors to 3D segmentation models, improving performance with minimal overhead.
problem Lack of explicit geometric information in 3D semantic segmentation models.
method Introduces GIBLy, a lightweight geometric inductive bias layer that integrates learnable geometric priors into existing 3D segmentation pipelines.
result Consistent performance gains across multiple benchmarks, including up to +11.5% mIoU on TS40K with PTV3.
BERTino is a lightweight Italian DistilBERT model for NLP tasks.
problem High computational and memory demands of large language models.
method Developed a DistilBERT model tailored for Italian language.
result F1 scores comparable to BERTBASE with significant speed improvements.
TinyXRA assesses financial risks from 10-K reports using a lightweight transformer model.
problem Comprehensive risk assessment from financial reports, distinguishing between upside and downside risk.
method Lightweight transformer model with dynamic attention, incorporating skewness, kurtosis, and Sortino ratio.
result State-of-the-art predictive accuracy and transparent risk assessments.
Coresets are compact representations of data sets such that models trained on a coreset are provably competitive with models trained on the full data set. As such, they have been successfully used to scale up clustering models to massive data sets. While existing approaches generally only allow for multiplicative appro…
The cycling operation is a special kind of conjugation that can be applied to elements in Artin's braid groups, in order to reduce their length. It is a key ingredient of the usual solutions to the conjugacy problem in braid groups. In their seminal paper on braid-cryptography, Ko, Lee et al. proposed the {\it cycling …
Recent advances in cryptography promise to enable secure statistical computation on encrypted data, whereby a limited set of operations can be carried out without the need to first decrypt. We review these homomorphic encryption schemes in a manner accessible to statisticians and machine learners, focusing on pertinent…
We introduce an adaptive output-sensitive Metropolis-Hastings algorithm for probabilistic models expressed as programs, Adaptive Lightweight Metropolis-Hastings (AdLMH). The algorithm extends Lightweight Metropolis-Hastings (LMH) by adjusting the probabilities of proposing random variables for modification to improve c…
A lightweight framework improves convergence and stability of PINNs for complex PDEs.
problem Training instability and reduced accuracy in PINNs for complex PDEs.
method Adaptive curvature correction using secant information to optimize first-order optimizers.
result Consistent improvements in convergence speed, stability, and accuracy over standard optimizers.
Method designs lightweight, structurally robust shell objects.
problem Designing lightweight, structurally robust shell objects under external forces.
method Shape parametrization based on Laplace's equation for smooth, intersection-free boundaries; gradient-free optimization algorithm.
result Practical solution to structural design of hollow objects with single inner cavity.
Optimizes neural architecture search to generate novel lightweight models.
problem Over-reliance on expert knowledge limits NAS to local optima, preventing architectural breakthroughs.
method Casts NAS as an optimization problem, introduces a hierarchical graph-based search space, and uses Bayesian optimization.
result Generates extremely lightweight yet competitive models on six benchmark datasets.
ELF improves FM forecasts by efficiently using online feedback.
problem Fixed FMs fail to adapt to current data characteristics.
method ELF-Forecaster learns current data distribution, ELF-Weighter combines forecasts.
result ELF improves FM forecasts across various datasets.
Enhances fault tolerance of neural networks for security-critical applications.
problem Fault tolerance of neural networks is biased and can lead to severe consequences in security-critical scenarios.
method Proposes a revised implementation that significantly enhances the fault tolerance property of neural networks with detailed mathematical analysis.
result Significantly increased fault tolerance of neural networks for security-critical applications.
Interpretable additive models outperform complex DL and hybrid pipelines for air quality forecasting.
problem Accurate forecasting of urban air pollution for public health and policy guidance.
method Investigated lightweight additive models (FBP, NP) vs. deep learning and hybrid pipelines on Beijing PM2.5 and PM10 data.
result Facebook Prophet consistently outperformed NeuralProphet and traditional models, achieving high R2 values. Sitatapatra blocks adversarial samples across different neural networks.
problem Adversarial samples can trick multiple neural networks trained on the same task.
method Sitatapatra diversifies neural networks using a cryptographic key and detects adversarial samples.
result Sitatapatra can trace back adversarial samples to the device that created them.
Kolmogorov-Arnold network improves GW catalog posterior construction.
problem Efficiently constructing posterior distributions for GW catalogs.
method Using the Kolmogorov-Arnold network to create lightweight neural density estimators.
result Kolmogorov-Arnold network achieves superior interpretability and accuracy in posterior construction.
Reservoir Computing (RC) refers to a Recurrent Neural Networks (RNNs) framework, frequently used for sequence learning and time series prediction. The RC system consists of a random fixed-weight RNN (the input-hidden reservoir layer) and a classifier (the hidden-output readout layer). Here we focus on the sequence lear…
Flatland is a simple, lightweight environment for fast prototyping and testing of reinforcement learning agents. It is of lower complexity compared to similar 3D platforms (e.g. DeepMind Lab or VizDoom), but emulates physical properties of the real world, such as continuity, multi-modal partially-observable states with…
ReRe detects anomalies in real-time for time series data.
problem Real-time anomaly detection for time series data requires human intervention or domain knowledge and high computation complexity.
method ReRe uses two lightweight LSTM models to predict and determine anomalies based on historical data and adaptive thresholds.
result ReRe detects anomalies in real-time without requiring human intervention or domain knowledge.
Paper discusses privacy issues in IoT and proposes a lightweight neural network approach.
problem Privacy concerns in IoT due to extensive data collection and processing.
method Developed a privacy-preserving inference approach for IoT objects and a deep neural network in the cloud.
result Satisfactory performance of the proposed approach on the MNIST dataset.
A new method for growing neural networks by splitting neurons, improving efficiency.
problem Optimizing neural network structures, especially for lightweight architectures.
method A progressive training approach using steepest descent to adaptively grow and split neurons.
result The method provides a computationally efficient way to optimize neural network structures.
Method transfers feature representation from large to small models using perception coherence.
problem Transfer feature representation from large to small models.
method Defines perception coherence, proposes loss function to minimize.
result Method outperforms or achieves on-par performance compared to strong baseline methods.
FLAML automates model selection and hyperparameter tuning with low resource cost.
problem Automating model selection and hyperparameter tuning for ad-hoc datasets and metrics.
method Conducts trials of different configurations on training data, optimizing for low computational cost.
result Significantly outperforms top-ranked AutoML libraries under smaller budget constraints.
FEDS distills LIC model knowledge into a lightweight student for efficient compression.
problem Efficiently compress images with high performance and low resources.
method FEDS combines feature alignment and entropy-based loss for lightweight compression.
result Student model matches teacher's performance while reducing parameters and speeding up.
SteganoGAN hides data in images with high capacity and high quality.
problem Hiding secret messages in images without detection.
method Generative adversarial networks (GANs) to optimize image quality and payload size.
result Achieves 4.4 bits per pixel payload, evades steganalysis, works on multiple datasets.
iSTFTNet speeds up mel-spectrogram vocoders without sacrificing quality.
problem Efficiently converting mel-spectrograms to speech with minimal computation.
method Replaces convolutional layers with iSTFT after frequency dimension reduction.
result Significant reduction in computational cost with comparable quality.
SWIFT improves time series forecasting on edge devices with wavelet decomposition.
problem Efficient time series forecasting on resource-constrained devices.
method Wavelet decomposition, cross-band fusion, and shared linear mapping.
result SWIFT achieves state-of-the-art performance on multiple datasets.
PPD defends deep learning models against adversarial attacks using image permutations and Fourier phases.
problem Adversarial examples can mislead deep learning models.
method Combines random image permutation with Fourier phase components.
result Demonstrated state-of-the-art robustness against adversarial attacks.
This work optimizes DNN inference for energy-harvesting devices by compressing and selectively executing neural network exits.
problem Inference delays and energy inefficiency in energy-harvesting devices.
method Developed a power trace-aware and exit-guided network compression algorithm for multi-exit neural networks.
result Superior accuracy and reduced latency compared to state-of-the-art techniques.
A novel framework combines LLMs and RL for financial portfolio optimization.
problem Optimizing financial portfolios using sentiment analysis and market indicators.
method Hierarchical RL structure with base, meta, and super-agents.
result Achieved a 26% annualized return and Sharpe ratio of 1.2.