This paper optimizes SMPC for neural network inference, reducing memory and time.
problem Memory and time constraints in secure neural network inference.
method Implemented ABY2.0 protocol, optimized memory usage, and used a helper node.
result MNIST inference reduced from 8.03 GB RAM and 200s to 0.2 GB RAM and 32s.
New method learns transmission matrices from input-output data.
problem Recovering transmission matrices from input-output data in random media.
method Statistical mechanical formulation and pseudolikelihood maximization.
result Inference protocols can learn transmission couplings.
New study on time series anomaly detection shows overlapping inference improves performance.
problem Heterogeneous evaluation practices and inference procedures in time series anomaly detection.
method Unified training, tuning, and evaluation protocol on TSB-AD benchmark, analyzing overlapping vs. disjoint inference.
result Overlapping inference yields consistent improvements, with average relative gain up to +28%.
Autoencoders improve wireless protocol classification with fewer parameters and higher accuracy.
problem Classifying wireless protocols with high accuracy and low computational complexity.
method Training FC deep learning networks using multiple denoising autoencoders.
result AE-trained networks achieve higher accuracy than reference FC networks for various SNR values.
FreB protocol uses AI to infer hidden parameters with valid confidence regions.
problem Generating biased or overconfident conclusions from AI-generated posterior distributions.
method Frequentist-Bayes (FreB) protocol reshapes AI-generated posterior distributions into valid confidence regions.
result FreB provides valid confidence regions that consistently include true parameters with expected probability.
Study of Langevin algorithm in noisy high-dimensional inference.
problem Analyzing the Langevin algorithm's performance in noisy high-dimensional inference.
method Analytic study of Langevin algorithm's performances using the spiked matrix-tensor model.
result The algorithmic threshold of the Langevin algorithm is sub-optimal compared to AMP.
Paper explores anchoring for vision models, improving generalization and safety.
problem Anchoring can lead to undesirable shortcuts, limiting generalization.
method Introduced a new anchored training protocol with a regularizer to mitigate undesirable shortcuts.
result Significant performance gains in generalization and safety metrics.
Hybrid LLM generates synthetic data preserving causal parameters.
problem Synthetic data fails to accurately estimate causal effects.
method Combines model-based covariate synthesis with separately learned propensity and outcome models.
result Hybrid framework ensures causal structure in synthetic data.
Scoping review of EO-ML methods for causal inference in poverty geography.
problem Lack of thorough documentation and best practices for EO-ML methods in causal analysis.
method Comprehensive scoping review cataloging five principal approaches.
result Detailed protocol for integrating EO data into causal analysis.
New method infers viral load from pooled tests.
problem Inefficient viral load inference in pooled testing.
method Message passing algorithm with PCR noise function.
result Accurate viral load inference possible.
New protocol evaluates synthetic data for temporal consistency.
problem Synthetic data generators can produce invalid timestamps and trajectories.
method Characterize datasets by four properties, then measure timestamp validity and dynamics.
result Temporal fidelity must be measured, not inferred from static data.
This paper explores how interactive protocols enhance local differential privacy.
problem The power of interactive protocols in local differential privacy.
method Classification of locally private protocols by compositionality and transformation of fully interactive protocols into sequentially interactive ones.
result Fully interactive protocols can solve problems that sequentially interactive protocols cannot without a significant increase in sample complexity.
SIREN protocol corrects optimistic winner's scores in LLM evaluation.
problem Optimistic winner's scores in LLM evaluation due to adaptive benchmarking.
method SIREN protocol that freezes post-search shortlist, separates selection and evaluation, and uses bootstrap for uncertainty quantification.
result SIREN provides valid confidence intervals for procedure-performance curves and deployment conclusions.
AriaNN enables private deep learning with minimal interaction and reduced key sizes.
problem Private deep learning with minimal interaction and reduced key sizes.
method Semi-honest 2-party computation protocol with function secret sharing, optimized primitives for neural network operations.
result Efficient private comparison for ReLU operations with reduced key size and improved performance.
Maker Protocol manages Dai stable coin on Ethereum blockchain.
problem Managing decentralized finance applications on blockchain.
method Analyzes Maker Protocol's components and governance.
result Maker Protocol is a significant decentralized finance application.
Three scenarios for continual learning tasks are described and compared.
problem Difficulty in comparing continual learning methods due to different evaluation protocols.
method Three continual learning scenarios based on task identity and inference requirements.
result Different scenarios have varying difficulty and require different approaches.
Compound Finance optimizes risk metrics for V3 protocol using Chainrisk simulations.
problem Optimizing systemic risks in Compound V3 protocol.
method Millions of Chainrisk simulations to evaluate VaR and LaR, providing parameter adjustments.
result Optimization framework enhances protocol stability.
This paper examines interest rates and market efficiency in DeFi loanable funds protocols.
problem Equilibrium of supply and demand for loanable funds in DeFi protocols.
method Review of interest rate mechanisms in Compound, Aave, and dYdX; empirical analysis of market efficiency and inter-connectedness.
result Interest rate rules in DeFi protocols do not always equilibrate supply and demand.
We present a novel probabilistic programming framework that couples directly to existing large-scale simulators through a cross-platform probabilistic execution protocol, which allows general-purpose inference engines to record and control random number draws within simulators in a language-agnostic way. The execution …
New federated learning protocols resist Byzantine failures and offer privacy guarantees.
problem Resisting Byzantine failures in federated learning.
method Proposes robust federated learning protocols with optimal statistical rates and privacy guarantees.
result Achieves nearly optimal statistical rates and tight rate in terms of all parameters for strongly convex losses.
The paper analyzes how mutable blockchain protocols affect miner behavior and strategic stability.
problem The mutability of blockchain protocols undermines long-term planning and cooperative equilibria.
method Integrates Austrian capital theory with repeated game theory to examine miner behavior under different institutional conditions.
result Effective time preference increases when protocol rules are mutable, leading to political rent-seeking and undermining strategic coherence.
Protocol minimizes disclosure in classification tasks.
problem Ensuring minimal disclosure in classification protocols.
method Developed a protocol for multi-party classification that minimizes non-responsive document disclosure.
result Guarantees minimal disclosure of non-responsive documents.
Computer vision model automates residual plot assessment for diagnosing model assumptions.
problem Automating residual plot assessment for model diagnostics.
method Trains a computer vision model to predict disparity between residual distributions and reference distributions using Kullback-Leibler divergence.
result Computer vision model is less sensitive to non-linearity but more sensitive than human judgment and conventional tests.
This study measures liquidity risks in Aave, a blockchain lending protocol.
problem Liquidity risks in lending protocols, especially in Aave.
method Measurements of liquidity risks using Aave as a case study, focusing on available liquidity and market concentration.
result Liquidity risks in Aave are volatile and affect the protocol negatively, especially for repeat borrowers.
Paper presents a risk management framework for blockchain protocols.
problem Blockchain protocol risks affecting DLT and digital assets.
method Developed a comprehensive risk management framework using traditional taxonomy.
result Structured approach to identify, measure, monitor and report blockchain protocol risks.
Study analyzes risk management in Aave and Compound lending protocols, finding v3 better than v2.
problem Risk management in decentralized lending protocols.
method Cross-version and cross-chain analysis using fixed effects model.
result v3 protocols have better risk management, with stronger impact on L2 blockchains.
Automated medical protocol uses neural networks and decision trees.
problem Improving healthcare delivery through automated decision-making.
method Hybrid model combining neural networks and decision trees.
result Effective early decisions for patient care.
Markov chain Monte Carlo (MCMC) is one of the main workhorses of probabilistic inference, but it is notoriously hard to measure the quality of approximate posterior samples. This challenge is particularly salient in black box inference methods, which can hide details and obscure inference failures. In this work, we ext…
The paper gives bounds for how long it takes for gossip protocols to spread information in networks.
problem Understanding the diffusion time in asynchronous gossip protocols.
method Provides non-asymptotic bounds for the number of messages needed for consensus in asynchronous gossip protocols.
result Explicit formula and approximation for the number of messages needed for consensus in different types of graphs.
New method identifies drivers from car logs without reverse-engineering CAN protocol.
problem Identifying drivers from in-vehicle network logs without access to exact signal semantics.
method Machine learning techniques applied to off-the-shelf data.
result Driver re-identification accuracy of 75-85% on a dataset of 33 drivers.
Etalumis bridges scientific simulators and probabilistic programming.
problem Infeasibility of rewriting scientific simulators for Bayesian inference.
method Cross-platform probabilistic execution protocol, MCMC and IC engines, distributed training of 3DCNN-LSTM.
result Achieved largest-scale posterior inference in a Turing-complete PPL for LHC use-case.
Paper explores how to design federated learning protocols that benefit all participants while maintaining privacy.
problem Privacy concerns undermine the accuracy benefits of federated learning in privacy-sensitive domains.
method The paper provides conditions for mutually beneficial federated learning protocols and designs protocols that maximize total utility and accuracy.
result The paper demonstrates that federated learning can be designed to be mutually beneficial, striking a balance between privacy and model accuracy.
Poisoning datasets can reveal private details of other users' training points.
problem Integrity and privacy of machine learning training data.
method Active inference attacks that poison a small fraction of the training dataset.
result Poisoning as little as 0.1% of the training dataset can significantly boost inference attacks.
Improved privacy-preserving summation protocol with fewer messages.
problem Achieving efficient differential privacy in multi-party summation.
method Combining secure shuffling with Laplace mechanism in the shuffle model.
result Protocol with O(1/ε) error and O(log(n/δ)) messages per party. FEET protocol evaluates foundation models across three scenarios.
problem Lack of standardized evaluation protocols for foundation models.
method Structured evaluation protocol across three use cases: frozen, few-shot, and fine-tuned embeddings.
result Demonstrates comprehensive assessment of foundation models' effectiveness.
SLIP secures LLMs on edge devices by splitting computation and protecting sensitive parts.
problem Protecting LLMs on edge devices from theft and unauthorized use.
method SLIP uses matrix decomposition to split model computation between secure and vulnerable resources, ensuring zero accuracy degradation and minimal latency.
result SLIP is the first practical, secure hybrid protocol for protecting LLMs on edge devices.
A scalable protocol for federated averaging with privacy and correctness guarantees.
problem Privacy and correctness in federated learning from multiple parties.
method Scalable protocol using correlated and independent Gaussian noise, analyzed for differential privacy and graph topology.
result Nearly matches trusted curator model's utility with minimal communication.
Generative replay with feedback connections improves continual learning efficiency.
problem Catastrophic forgetting in artificial neural networks when learning new tasks.
method Split and permuted MNIST tasks, generative replay with distillation, and feedback connections.
result Generative replay with distillation outperformed other methods in all scenarios.
Survey of yield farming protocols in DeFi.
problem Understanding and evaluating yield farming mechanisms in DeFi.
method Analyzed smart contracts, performed simulations, reviewed literature.
result Characterized major yield aggregators and identified risks.
New protocol makes federated learning more scalable and private.
problem Securely aggregate data from distributed, private datasets.
method Proposes a new protocol for aggregation in the shuffled model that is more efficient in terms of communication and error.
result Achieves differential privacy guarantees with polylogarithmic scaling in the number of users.
A new cryptocurrency issuance protocol using proof-of-work without mining electricity.
problem Creating digital currencies without relying on electricity.
method Alternative asset utilization for cryptocurrency creation.
result Supports digital currencies in a proof-of-work manner without mining electricity.
Superconducting circuit technologies have recently achieved quantum protocols involving closed feedback loops. Quantum artificial intelligence and quantum machine learning are emerging fields inside quantum technologies which may enable quantum devices to acquire information from the outer world and improve themselves …
Paper harmonizes medical data using flow-based causal inference.
problem Heterogeneity in medical data from different sites and protocols.
method Flow-based normalizing method for counterfactual inference on structural causal models.
result Better cross-domain generalization compared to state-of-the-art algorithms.
This study aims to improve communication between fragmented blockchain systems in finance.
problem Inefficient and insecure communication in fragmented blockchain systems.
method Analysis of cross-chain interoperability protocols and their properties.
result Comparison and evaluation of cross-chain interoperability protocols.
Proposes clustering as a new evaluation method for clinical knowledge embedding.
problem Traditional Link Prediction evaluation protocol loses information and harms model accuracy.
method Proposes Clustering Evaluation Protocol as an alternative.
result Experimental results show the proposed protocol can potentially replace Link Prediction.
Noise-aware Bayesian inference framework for locally private data collection.
problem Privacy-preserving data collection with non-trustworthy aggregators.
method Noise-aware probabilistic modeling framework for Bayesian inference under LDP.
result Demonstrated efficacy in parameter estimation for various distributions and regression models.
Study analyzes financial intermediation costs in decentralized lending protocols.
problem Understanding the cost of financial intermediation in decentralized lending protocols.
method Analysis of publicly available data on rates, supply, borrow activity, and accounts.
result Ex-post margins are 1% and lower for stablecoin markets.
New protocol reduces communication costs for heterogeneous bandits over complex networks.
problem Minimizing group regret in a multi-agent, heterogeneous bandit setting over complex networks.
method Flooding with Absorption (FwA) protocol for heterogeneous bandits over complex networks.
result FwA protocol significantly reduces communication costs compared to flooding while maintaining similar regret performance.