Search
Now showing items 21-30 of 107
Stochastic approximation with set-valued maps and Markov noise: Theoretical foundations and applications
Stochastic approximation algorithms produce estimates of a desired solution using noisy real world data.
Introduced by Robbins and Monro, in 1951, stochastic approximation techniques have been instrumental in
the asymptotic ...
Structured Regularization Through Convex Relaxations Of Discrete Penalties
Motivation. Empirical risk minimization(ERM) is a popular framework for learning predictive
models from data, which has been used in various domains such as computer vision, text
processing, bioinformatics, neuro-biology, ...
Adaptively Secure Primitives in the Random Oracle Model
Adaptive security embodies one of the strongest notions of security that allows an adversary to corrupt
parties at any point during protocol execution and gain access to its internal state. Since it models reallife
situations ...
Statistical Network Analysis: Community Structure, Fairness Constraints, and Emergent Behavior
Networks or graphs provide mathematical tools for describing and analyzing relational data. They are used in biology to model interactions between proteins, in economics to identify trade alliances among countries, in ...
Typestates and Beyond: Verifying Rich Behavioral Properties Over Complex Programs
Statically verifying behavioral properties of programs is an important research problem. An
efficient solution to this problem will have visible effects over multiple domains, ranging from
program development, program ...
Handling Overloads with Social Consistency
Cloud computing applications have dynamic workloads, and they often observe spikes in the
incoming traffic which might result in system overloads. System overloads are generally handled by
various load balancing techniques ...
Optimizing Dense Matrix Computations with PolyMage
Linear algebra computations and other arbitrary affine accesses are ubiquitous in applications
from domains like scientific computing, digital signal processing (DSP), and deep
neural networks. Libraries such as OpenBLAS, ...
Design and Evaluation of Parallel Coded Systems
In this computer era, we all live in a place where the demand for data and computing is increasing day by day. Since the need for faster data retrieval and faster computation brings us a reliability as the solution, we ...
Coded Caching in Multi-access Networks
Caching is a promising technique that can reduce the amount of data transmitted over latency-prone
links, effectively trading affordable memory for expensive bandwidth resources. The frequently
demanded content is stored ...
Honest Majority and Beyond: Efficient Secure Computation over Small Population
Secure Multi-Party Computation for small population has witnessed notable practically-efficient works
in the setting of both honest majority and dishonest majority. While honest majority provides the promise
of stronger ...