Research
On-device research index

arXiv research

A locally-built, LLM-digested index of recent arXiv papers in quant finance, geometry/topology, and statistical ML — keyword search served straight from SQLite on this machine.

168,695 papers · 148 categories

Trend · papers per month

3.6%7.3%10.9%14.6% · May 202619922001200920172026
48 results for adaptive protocols

New protocols show 1-bit mean estimation can be order-optimal without interaction.

problem Can 1-bit mean estimation be optimal without interaction?
method Adaptive and non-adaptive threshold and interval queries, with one adaptive transition.
result Arbitrary non-adaptive quantizers can match the adaptive rate, suggesting interaction is not necessary.

We develop a secure aggregation protocol for federated learning that reduces communication and computation costs.

problem Expensive communication and privacy concerns in federated learning.
method Adapting compression-based federated techniques to additive secret sharing.
result Our protocol achieves high accuracy with low communication costs and is more efficient than prior work.

This paper improves MARL for networked systems through new protocols and discount factors.

problem Improving control in networked systems using multi-agent reinforcement learning.
method Formulated as a spatiotemporal Markov decision process, introduced a spatial discount factor, and proposed NeurComm.
result Appropriate spatial discount factor enhances learning curves of non-communicative MARL algorithms.

We study the power of interactivity in local differential privacy. First, we focus on the difference between fully interactive and sequentially interactive protocols. Sequentially interactive protocols may query users adaptively in sequence, but they cannot return to previously queried users. The vast majority of exist…

2019-04-07abs ↗pdf ↗

Adapts CNN for robust medical image segmentation across different scanners and protocols.

problem Performance degradation of CNNs in medical image segmentation due to mismatch between training and test images.
method Designs a segmentation CNN as a concatenation of a shallow normalization CNN and a deep CNN. At test time, adapts the normalization sub-network for each test image using a denoising autoencoder.
result Consistently improves performance on multi-center MRI datasets of brain, heart, and prostate.

Adaptive pricing framework for perpetual contracts using liquidity curves and oracles.

problem Ensuring stable and predictable pricing for perpetual contracts.
method Uses liquidity curves and on-chain oracles with parabolic and sigmoid functions to quote prices and fees.
result Ensures pricing stability and predictability through adaptive pricing framework.

A contextual care protocol is used by a medical practitioner for patient healthcare, given the context or situation that the specified patient is in. This paper proposes a method to build an automated self-adapting protocol which can help make relevant, early decisions for effective healthcare delivery. The hybrid mode…

2018-11-15abs ↗pdf ↗

MACC learns communication protocols by adapting counterfactual reasoning.

problem Credit assignment and non-stationarity in communication environments.
method Adapts counterfactual reasoning to overcome credit assignment and uses action policy and Q-function of other agents to handle non-stationarity.
result MACC outperforms state-of-the-art baselines in four scenarios.

This paper improves domain adaptation methods using graph embedding.

problem Alleviating distribution gaps between different data domains.
method Formulate domain adaptation as graph embedding, analyze loss functions, propose rectified evaluation protocol.
result Improved benchmarks on standard datasets demonstrate the effectiveness of the proposed methods.

Protocol for constructing tailored evaluation datasets for semantic models.

problem Evaluation of domain-specific semantic models, focusing on top ranks.
method Adaptive pairwise comparisons, relatedness-based evaluation dataset, metrics, stochastic transitivity model.
result Effectiveness of the proposed dataset construction protocol confirmed.

We consider distributed online learning protocols that control the exchange of information between local learners in a round-based learning scenario. The learning performance of such a protocol is intuitively optimal if approximately the same loss is incurred as in a hypothetical serial setting. If a protocol accomplis…

2019-11-28abs ↗pdf ↗

We propose an efficient protocol for decentralized training of deep neural networks from distributed data sources. The proposed protocol allows to handle different phases of model training equally well and to quickly adapt to concept drifts. This leads to a reduction of communication by an order of magnitude compared t…

2018-07-09abs ↗pdf ↗

FastSecAgg improves federated learning security and efficiency.

problem Privacy leakage in federated learning due to model parameter sharing.
method Introduces FastSecAgg, a secure aggregation protocol with FFT-based multi-secret sharing (FastShare).
result Efficient in computation and communication, robust to client dropouts.

This work introduces a protocol to automatically select the correct range of scales for meaningful Intrinsic Dimension estimation.

problem The Intrinsic Dimension (ID) varies with scale in real-world datasets, leading to erroneous results.
method The protocol selects the correct range of scales by ensuring constant density of data points.
result The method provides a robust and scale-adaptive approach to estimating meaningful Intrinsic Dimension.

Auto..gov uses RL to automate DeFi governance, improving security and profitability.

problem Manual DeFi governance is prone to human bias and financial risks.
method Auto..gov employs a deep Q-network reinforcement learning strategy for semi-automated parameter adjustments.
result Auto..gov outperforms traditional governance methods by at least 14% in terms of protocol profitability.

Dynamic pricing improves DeFi lending efficiency by reducing regret to logarithmic levels.

problem Static pricing mechanisms in DeFi lending protocols lead to suboptimal welfare and revenue.
method Online learning model for static and dynamic pricing models in DeFi lending.
result Adaptive supply models achieve logarithmic regret, outperforming static models.

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.

In this work, a heuristic as operational tool to estimate the lactate threshold and to facilitate its integration into the training process of recreational runners is proposed. To do so, we formalize the principles for the lactate threshold estimation from empirical data and an iterative methodology that enables experi…

2019-03-06abs ↗pdf ↗

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.

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.

COMP-AMS optimizes distributed training with compressed gradients, achieving similar accuracy with less communication.

problem Efficiently training large-scale models in distributed environments with reduced communication costs.
method Distributed optimization framework using gradient averaging and adaptive AMSGrad, with gradient compression and error feedback.
result COMP-AMS achieves the same convergence rate and linear speedup as standard AMSGrad with less communication.

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.

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.

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.

FDN improves probabilistic regressors' adaptability to distribution shifts.

problem Overconfidence in modern probabilistic regressors under distribution shift.
method FDN uses input-conditioned distributions over network weights, trained with a Monte Carlo beta-ELBO objective.
result FDN produces predictive mixtures whose dispersion adapts to the input, providing shift-aware uncertainty.

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.

Although convolutional neural networks (CNNs) currently dominate competitions on image segmentation, for neuroimaging analysis tasks, more classical generative approaches based on mixture models are still used in practice to parcellate brains. To bridge the gap between the two, in this paper we propose a marriage betwe…

2019-02-27abs ↗pdf ↗

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.

In distributed learning, the goal is to perform a learning task over data distributed across multiple nodes with minimal (expensive) communication. Prior work (Daume III et al., 2012) proposes a general model that bounds the communication required for learning classifiers while allowing for $\eps$ training error on lin…

2012-04-16abs ↗pdf ↗

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.

In recent work, Cheu et al. (Eurocrypt 2019) proposed a protocol for nn-party real summation in the shuffle model of differential privacy with Oε,δ(1)O_{ε, δ}(1) error and Θ(εn)Θ(ε\sqrt{n}) one-bit messages per party. In contrast, every local model protocol for real summation must incur error Ω(1/n)Ω(1/\sqrt{n}), and there exist …

2019-06-20abs ↗pdf ↗

Dynamic memory prevents forgetting in continuous learning of medical images.

problem Catastrophic forgetting in machine learning models over time due to domain shifts.
method Dynamic memory to store and replay diverse training data subsets.
result Dynamic memory mitigates forgetting without knowing when shifts occur.