activity
20202023
most citedOptimal l-one Rank One Matrix Decompositions

44 citations · 60 across the 12 of their papers we have counts for

collaborators

12 papers

cs.CR2023

CryptoVampire: Automated Reasoning for the Complete Symbolic Attacker Cryptographic Model

Simon Jeanteur, Laura Kovács, Matteo Maffei +1

Cryptographic protocols are hard to design and prove correct, as witnessed by the ever-growing list of attacks even on protocol standards. Symbolic models of cryptography enable au…

cs.LO2023★ 5 cited

Lemmas: Generation, Selection, Application

Michael Rawson, Christoph Wernhard, Zsolt Zombori +1

Noting that lemmas are a key feature of mathematics, we engage in an investigation of the role of lemmas in automated theorem proving. The paper describes experiments with a combin…

eess.IV2022★ 3 cited

Motion correction in MRI using deep learning and a novel hybrid loss function

Lei Zhang, Xiaoke Wang, Michael Rawson +6

Purpose To develop and evaluate a deep learning-based method (MC-Net) to suppress motion artifacts in brain magnetic resonance imaging (MRI). Methods MC-Net was derived from a UNet…

cs.DC2022

Petri Nets for Concurrent Programming

Marshall Rawson, Michael Rawson

Concurrent programming is used in all large and complex computer systems. However, concurrency errors and system failures (ex: crashes and deadlocks) are common. We find that Petri…

cs.LG2022

Renormalized Sparse Neural Network Pruning

Michael G. Rawson

Large neural networks are heavily over-parameterized. This is done because it improves training to optimality. However once the network is trained, this means many parameters can b…

cs.DC2022

Linear Run Time of Persistent Homology Computation with GPU Parallelization

Michael G. Rawson

Persistent homology is a crucial invariant that is used in many areas to understand data. The run time is a hindrance to its use on most large datasets. We give a parallel…

cs.CL2022★ 1 cited

Topological Data Analysis for Word Sense Disambiguation

Michael Rawson, Samuel Dooley, Mithun Bharadwaj +1

We develop and test a novel unsupervised algorithm for word sense induction and disambiguation which uses topological data analysis. Typical approaches to the problem involve clust…

eess.IV2022

Optimal Transport for Super Resolution Applied to Astronomy Imaging

Michael Rawson, Jakob Hultgren

Super resolution is an essential tool in optics, especially on interstellar scales, due to physical laws restricting possible imaging resolution. We propose using optimal transport…

cs.LG2022★ 1 cited

Top-K Ranking Deep Contextual Bandits for Information Selection Systems

Jade Freeman, Michael Rawson

In today's technology environment, information is abundant, dynamic, and heterogeneous in nature. Automated filtering and prioritization of information is based on the distinction…

cs.LG2022★ 6 cited

Convergence Guarantees for Deep Epsilon Greedy Policy Learning

Michael Rawson, Radu Balan

Policy learning is a quickly growing area. As robotics and computers control day-to-day life, their error rate needs to be minimized and controlled. There are many policy learning…

cs.LG2021

Deep Upper Confidence Bound Algorithm for Contextual Bandit Ranking of Information Selection

Michael Rawson, Jade Freeman

Contextual multi-armed bandits (CMAB) have been widely used for learning to filter and prioritize information according to a user's interest. In this work, we analyze top-K ranking…

math.FA2020★ 44 cited

Optimal l-one Rank One Matrix Decompositions

Radu Balan, Kasso A. Okoudjou, Michael Rawson +2

In this paper we consider the decomposition of positive semidefinite matrices as a sum of rank one matrices. We introduce and investigate the properties of various measures of opti…