Agents learn to communicate and solve navigation tasks efficiently.
problem Understanding and developing communication in artificial agents.
method Multi-agent navigation tasks in gridworld environments.
result Agents develop an interpretable communication protocol that optimally solves tasks.
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 …
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.
CutMix training technique improves spatial locality in Vision Transformers.
problem Improving spatial locality in Vision Transformers trained from scratch.
method Comparison of Baseline and Modern training protocols on CIFAR-10, CIFAR-100, and Tiny-ImageNet.
result CutMix training component significantly reduces Mean Attention Distance (MAD) in early layers of Vision Transformers.
The study analyzes how cross-chain interoperability affects decentralized lending protocols' performance.
problem Understudied cross-chain elements in DeFi lending risk management.
method Panel regression fixed effects and OLS models applied to empirical analysis.
result Cross-chain activity impacts protocol performance, with bridge volume being a critical driver.
Graphs help agents learn emergent communication.
problem Learning robust communication protocols in multi-agent systems.
method Graph convolutional networks to model emergent language and cooperation.
result Agents learn to generalize beyond training samples, revealing true factors of variation.
The paper examines how decentralized credit curators have taken over risk management from traditional protocols.
problem Risk management in decentralized credit has shifted from centralized protocols to decentralized curators.
method Analysis of ERC 4626 vaults and third-party curators, focusing on capital utilization, concentration, and fee margins.
result Curators have a significant impact on the risk profile of decentralized credit systems, with a small set of curators handling a disproportionate share of system TVL.
The paper analyzes risks and revenue dynamics of a liquid restaking protocol in decentralized finance.
problem Interconnected risks and revenue dynamics of a liquid restaking protocol in decentralized finance.
method Empirical analysis using OLS regression, Granger-causality, and random forest feature importance tests.
result Revenue is primarily driven by value locked in the ecosystem, yield of liquid restaking token, and multi-blockchain expansion.
We study the quantum synchronization between a pair of two-level systems inside two coupled cavities. By using a digital-analog decomposition of the master equation that rules the system dynamics, we show that this approach leads to quantum synchronization between both two-level systems. Moreover, we can identify in th…
Paper explores why compositionality is not the right approach for emergent communication.
problem Lack of interaction between biological and computational models of emergent communication.
method Exploring the claim that compositionality is the wrong target for explaining natural language emergence.
result Suggests reflexivity as a better target for explaining natural language emergence.
Paper introduces supervised and unsupervised TAM models for binary neurons.
problem Learning and retrieval of structured triplets of patterns in neural networks.
method Extends Hebbian paradigm to supervised and unsupervised protocols, using glassy statistical mechanical techniques.
result Obtained self-consistency equations for critical dataset sizes and retrieval performance.
New cooperative dynamics enhances retrieval performance in neural networks.
problem Understanding emergent computational capabilities in disordered systems.
method Leveraging statistical mechanics, extended neural network architecture for hetero-associative memory.
result Layers trained with less informative datasets develop retrieval regions of the same amplitude, leading to optimal performance.
Survey examines distillation methods for large language models.
problem Efficiently compress large language models while preserving their capabilities.
method Knowledge Distillation and Dataset Distillation techniques.
result Integrating KD and DD can produce more effective and scalable compression strategies.
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.
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.
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…
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.
This paper analyzes voter coalitions in MakerDAO's decentralized governance.
problem Understanding the governance structure and influence of voter coalitions in DAOs.
method Applied clustering algorithm to voting history of MakerDAO to identify voter coalitions.
result The emergence of a dominant voter coalition signals governance centralization in DAOs.
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.
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.
This paper examines unfair trading practices in NFT markets.
problem Sophisticated actors exploit market inefficiencies for unfair profits.
method Analyzes three types of opportunistic trading strategies.
result Identifies and categorizes unfair trading practices in NFT markets.
Survey on threats to federated learning models.
problem Vulnerabilities in federated learning protocols.
method Taxonomy of threat models and attacks.
result Important future research directions.
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.
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.
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.
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.
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.
In recent work, Cheu et al. (Eurocrypt 2019) proposed a protocol for n n n -party real summation in the shuffle model of differential privacy with O ε , δ ( 1 ) O_{ε, δ}(1) O ε , δ ( 1 ) error and Θ ( ε n ) Θ(ε\sqrt{n}) Θ ( ε n ) one-bit messages per party. In contrast, every local model protocol for real summation must incur error Ω ( 1 / n ) Ω(1/\sqrt{n}) Ω ( 1/ n ) , and there exist …
New framework explains neural network bias in solving differential equations.
problem Understanding and controlling the bias in PINNs for differential equations.
method Deriving an integro-differential equation from PINNs and GPR equivalence.
result PINN predictions are influenced by a kernel term reflecting architecture choices.
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.
This work studies differential privacy in the context of the recently proposed shuffle model. Unlike in the local model, where the server collecting privatized data from users can track back an input to a specific user, in the shuffle model users submit their privatized inputs to a server anonymously. This setup yields…
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.
Federated learning promises to make machine learning feasible on distributed, private datasets by implementing gradient descent using secure aggregation methods. The idea is to compute a global weight update without revealing the contributions of individual users. Current practical protocols for secure aggregation work…
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.
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…
Study proposes optimal risk-aware interest rates for crypto lending protocols.
problem Determining optimal interest rates for decentralized lending protocols to maximize profit and minimize risk.
method Agent-based model, Riccati-type ODEs for linear behaviors, Monte-Carlo estimator and deep learning for nonlinear behaviors.
result Calibrated model shows superior risk-adjusted performance compared to industry-standard interest rate models.
Secure Aggregation protocols allow a collection of mutually distrust parties, each holding a private value, to collaboratively compute the sum of those values without revealing the values themselves. We consider training a deep neural network in the Federated Learning model, using distributed stochastic gradient descen…
Swarm systems constitute a challenging problem for reinforcement learning (RL) as the algorithm needs to learn decentralized control policies that can cope with limited local sensing and communication abilities of the agents. While it is often difficult to directly define the behavior of the agents, simple communicatio…
FinReflectKG - EvalBench benchmarks financial KG extraction from SEC 10-K filings.
problem Lack of universal benchmark and evaluation framework for financial KG construction.
method Agentic and holistic evaluation principles, deterministic commit-then-justify judging protocol, binary and ordinal evaluations.
result Reflection-based extraction outperforms single-pass extraction in comprehensiveness, precision, and relevance.
New algorithms improve dueling bandit performance in multiplayer settings.
problem Challenges in collaborative exploration of non-informative arm pairs in multiplayer dueling bandits.
method Demonstrated Follow Your Leader approach and message-passing fully distributed protocol.
result Multiplayer algorithms outperform single-player benchmarks.
Panoptic trades options without oracles on Ethereum.
problem Trading options without relying on oracles.
method Perpetual, trustless, instant-settlement protocol on Ethereum.
result Trustless, permissionless trading of options on Uniswap v3.
Study on TVL computation in DeFi protocols, proposing verifiable metrics.
problem Lack of standardization and verifiability in TVL computation.
method Systematic study of 939 DeFi projects, analyzing methodologies and proposing vTVL.
result 240 protocols use repeated balance queries, limiting verifiability.
RLHF uses human feedback to train AI models, posing statistical challenges.
problem Aligning AI models with human preferences using noisy, subjective feedback.
method Supervised fine-tuning, reward modeling, policy optimization, statistical ideas.
result Statistical methods for reward function learning and policy optimization.
Survey of alignment techniques for large language models.
problem Ensuring large language models align with human values.
method Analysis of diverse alignment methods and training paradigms.
result Preference-based methods offer more flexibility for nuanced alignment.