Architecture of Automated Crypto Finance Agent

We present the cognitive architecture of an autonomous agent for active portfolio management in decentralized finance . It involves activities such as asset selection, portfolio balancing, liquidity provision, and trading . Partial implementation of the architecture is provided and supplied with preliminary results .…

More Robust Dense Retrieval with Contrastive Dual Learning

ContrastiveDual Learning for Approximate Nearest Neighbor (DANCE) is an effective training paradigm for dense retrieval . DANCE incorporates an additionaldual training object of query retrieval, inspired by the classic informationretrieval training axiom, query likelihood . With contrastive learning, the dualtraining object of DANCE learns more tailored representations for queries and documents to keep the embedding space smooth and uniform, thriving on theranking performance of Dance on the MS MARCO document retrieval task .…

Using a template engine as a computer algebra tool

This paper proposes a library and scripts for automated generation of routine functions inthe Julia programming language for a set of numerical schemes of Runge-Kuttamethods . The proposed approach allows us to use asingle template for editing, instead of modifying each individual function to be compared .…

Touring the MetaCoq Project Invited Paper

MetaCoq aims to provide the first fully-certified realistic implementation of a type checker for the full calculus underlying the Coq proofassistant . We show how theoretical tools such as bidirectional type-checking, Tait-Martin-L\”of/Takahashi’s confluence proof technique and monadic anddependently-typed programming can help construct the following artefacts: aspecification of Coq’s syntax and type theory, the Polymorphic Cumulative CumulativeCalculus of (Co)-Inductive Constructions (PCUIC); a monad for the manipulation of raw syntax and interaction with Coq system; a verification of PCUIC’smetatheory, whose main results are the confluence of reduction, typepreservation and principality of typing; a realistic, correct and completetype-checker for PCIC .…

Estimation from Partially Sampled Distributed Traces

Sampling is often a necessary evil to reduce the processing and storage cost of distributed tracing . The resulting traces are often onlypartially and not completely sampled which complicates statistical analysis . We describe a scalable and adaptivesampling approach that can preserve events of interest better than the widelyused head-based sampling approach .…

A method for decompilation of AMD GCN kernels to OpenCL

Decompilers are useful tools for software analysis and support in the absence of source code . None of the existing tools support modern AMD GPU architectures such as AMD GCN and RDNA . We aim at developing the first assembly decompiler tool for a modernAMD GPU architecture that generates code in the OpenCL language .…

Measuring and Explaining the Inter Cluster Reliability of Multidimensional Projections

Measuringinter-cluster reliability of multidimensional projection is crucial as it affects how well inter-luster tasks can be conducted . We propose Steadiness and Cohesiveness, two novel metrics to measure inter-clusters reliability . They extract random clusters with arbitrary shapes and positions in one space and evaluate how much the clusters are stretched or dispersed in the other space .…

Topology optimization using the unsmooth variational topology optimization UNVARTOP method An educational implementation in Matlab

This paper presents an efficient and comprehensive MATLAB code to solve two-dimensional structural topology optimization problems . The Unsmooth Variational Topology Optimization (UNVARTOP) method, developed by the authors in a previous work, is used in the topologyoptimization code . The code, intended for students and newcomers intopology optimization, is included as an appendix (Appendix A) and it can bedownloaded from https://github.com/DanielYago…

In Bed Person Monitoring Using Thermal Infrared Sensors

The world is expecting an aging population and shortage of healthcareprofessionals . This poses the problem of providing a safe and dignified lifefor the elderly . Technological solutions involving cameras can contribute to safety, comfort and efficient emergency responses, but they are invasive ofprivacy .…

Separated Red Blue Center Clustering

We study a generalization of $k$-center clustering, first introduced byKavand et. al., where instead of one set of centers, we have two types of centers . Each red center is at least $alpha$distant from each blue center, and the goal is to minimize the covering radius .…

Topology optimization using the unsmooth variational topology optimization UNVARTOP method An educational implementation in Matlab

This paper presents an efficient and comprehensive MATLAB code to solve two-dimensional structural topology optimization problems . The Unsmooth Variational Topology Optimization (UNVARTOP) method, developed by the authors in a previous work, is used in the topologyoptimization code . The code, intended for students and newcomers intopology optimization, is included as an appendix (Appendix A) and it can bedownloaded from https://github.com/DanielYago…

Demo Zelig Customizable Blockchain Simulator

Zelig: our blockchainsimulator designed with the main goals of customizability and extensibility . Zelig is the only blockchain simulator that enablessimulating custom network topologies without modifying the simulator code . We explain our simulator design, validate via experimental analysis against thereal-world Bitcoin network, and highlight potential use cases .…

Pseudo labelling Enhanced Media Bias Detection

This paper proposes a simple but effective data augmentation method . It uses pseudo-labelling to select samples from noisy distantsupervision datasets . The result shows that the proposed methodimproves the accuracy of biased news detection models . The proposed method shows that it can be used to improve news detection accuracy .…

Learning to Limit Data Collection via Scaling Laws Data Minimization Compliance in Practice

Data minimization is a legal obligation defined in the European Union’s General Data Protection Regulation (GDPR) as the responsibility to process anadequate, relevant, and limited amount of personal data in relation to aprocessing purpose . However, unlike fairness or transparency, the principle has not seen wide adoption for machine learning systems due to a lack ofcomputational interpretation .…

DoReMi First glance at a universal OMR dataset

The main challenges of Optical Music Recognition (OMR) come from the nature of written music, its complexity and the difficulty of finding an appropriatedata representation . DoReMi was generatedusing a music notation software and includes over 6400 printed sheet music images with accompanying metadata useful in OMR research .…

DxHash A Scalable Consistent Hash Based on the Pseudo Random Sequence

Consistent hasing has played a fundamental role as a data router and a loadbalancer in various fields, such as distributed database, cloud infrastructure, and peer-to-peer network . The existing consistent hashing schemescan’t meet the requirements simultaneously, including full consistency,scalability, small memory footprint, low update time and low query complexity .…

Adelfa A System for Reasoning about LF Specifications

We present a system called Adelfa that provides mechanized support for reasoning about specifications developed in the Edinburgh Logical Framework orLF . Typing judgements in LF are represented by atomic formulas in L_LF and quantification is permitted overcontexts and terms that appear in such formulas .…

Clustering of heterogeneous populations of networks

Statistical methods for reconstructing networks from repeated measurementstypically assume that all measurements are generated from the same underlying structure . We describe a Bayesian analysis framework for such data that allows for the fact that network measurements may be reflective of multiple possiblestructures .…

Verified Mutable Data Structures

Formal verification is the only form of sofware testing that can guarantee the absence of bugs . The implementation we propose is based on the LongMap of the Scala standard library with some minor adaptations . We give the specification withrespect to an implementation of a map based on a list of tuples, that we .plement…

A Functional Programming Language with Versions

Modern software development heavily uses versioned packages, but programming languages rarely support the concept of versions in their semantics . This paper proposes a programming language that intrinsically supports versions . The proposed core calculus, called Lambda VL, has versioned values, each containing different values under different versions .…

Proceedings of ICML 2021 Workshop on Theoretic Foundation Criticism and Application Trend of Explainable AI

This is the Proceedings of ICML 2021 Workshop on Theoretic Foundation,Criticism, and Application Trend of Explainable AI . Deep neural networks (DNNs) have brought great success to a wide range of applications incomputer vision, computational linguistics, and AI . Interpreting and theorizing the internalmechanisms of DNNs becomes a compelling yet controversial topic .…

Applying Declarative Analysis to Software Product Line Models An Industrial Study

Software Product Lines (SPLs) are families of related software products developed from a common set of artifacts . Most existing analysis tools can be applied to a single product at a time, but not to an entire SPL . In this paper, we take an existing declarative analysis (behaviouralteration) written in Grok, port it to Datalog, and apply it to a set of automotive software product lines from General Motors .…

DoReMi First glance at a universal OMR dataset

The main challenges of Optical Music Recognition (OMR) come from the nature of written music, its complexity and the difficulty of finding an appropriatedata representation . DoReMi was generatedusing a music notation software and includes over 6400 printed sheet music images with accompanying metadata useful in OMR research .…

Automating Induction by Reflection

In first-orderlogic induction requires an infinite number of axioms, which is not a feasible input to a computer-aided theorem prover requiring a finite input . In this work we introduce a new method, inspired by the field of axiomatictheories of truth, that allows to express schematic inductive definitions .…

Interacting Safely with an Unsafe Environment

We give a presentation of Pure type systems where contexts need not bewell-formed . We show that this presentation is equivalent to the usual one . The main motivation for this presentation was that, when we extend Pure type systemswith computation rules, we want to declare constants before the computation rules that are needed to check the type .…