Browsing Computer Science and Automation (CSA) by Title
Now showing items 69-88 of 552
-
Average Reward Actor-Critic with Deterministic Policy Search
The average reward criterion is relatively less studied as most existing works in the Reinforcement Learning literature consider the discounted reward criterion. There are few recent works that present on-policy average ... -
Bandit Algorithms: Fairness, Welfare, and Applications in Causal Inference
We study regret in online learning from a welfarist perspective and explore an application of bandit algorithms in causal inference. We introduce Nash regret, which measures the difference between the optimal action ... -
Barrier Function Inspired Reward Shaping in Reinforcement Learning
Reinforcement Learning (RL) has progressed from simple control tasks to complex real-world challenges with large state spaces. During initial iterations of training in most Reinforcement Learning (RL) algorithms, agents ... -
Battle of Bandits: Online Learning from Subsetwise Preferences and Other Structured Feedback
The elicitation and aggregation of preferences is often the key to making better decisions. Be it a perfume company wanting to relaunch their 5 most popular fragrances, a movie recommender system trying to rank the most ... -
Bayes Optimal Feature Selection for Supervised Learning
(2018-02-18)The problem of feature selection is critical in several areas of machine learning and data analysis such as, for example, cancer classification using gene expression data, text categorization, etc. In this work, we consider ... -
Bayesian Nonparametric Modeling of Temporal Coherence for Entity-Driven Video Analytics
(2018-05-14)In recent times there has been an explosion of online user-generated video content. This has generated significant research interest in video analytics. Human users understand videos based on high-level semantic ... -
Bimodal Projections Based Features for High Dimensional Pattern Classification
Classification tasks involving high-dimensional vectors are affected by the curse of dimensionality requiring large amount of training data. This is because a high dimensional space with a modest number of samples is ... -
Boolean Functional Synthesis using Gated Continuous Logic Networks
Boolean Functional Synthesis (BFS) is a well-known challenging problem in the domain of automated program synthesis from logical specifications. This problem aims to synthesize a Boolean function that is correct-by-construction ... -
Bounds On Augmented Automata And Quantum Adiabatic Optimization
(2009-05-25)Quantum computing has generated a lot of interested in the past two decades. Research into powerful models of quantum computation has yielded important and elegant results like an efficient algorithm for factoring and a ... -
Boxicity And Cubicity : A Study On Special Classes Of Graphs
(2014-06-02)Let F be a family of sets. A graph G is an intersection graph of sets from the family F if there exists a mapping f : V (G)→ F such that, An interval graph is an intersection graph of a family of closed intervals on the ... -
Boxicity, Cubicity And Vertex Cover
(2010-09-28)The boxicity of a graph G, denoted as box(G), is the minimum dimension d for which each vertex of G can be mapped to a d-dimensional axis-parallel box in Rd such that two boxes intersect if and only if the corresponding ... -
A Broadcast Cube-Based Multiprocessor Architecture for Solving Partial Differential Equations
(Indian Institute of Science, 2005-01-26)A large number of mathematical models in engineering and physical sciences employ Partial Differential Equations (PDEs). The sheer number of operations required in numerically integrating PDEs in these applications has ... -
Caching Techniques For Dynamic Web Servers
(2009-03-20)Websites are shifting from static model to dynamic model, in order to deliver their users with dynamic, interactive, and personalized experiences. However, dynamic content generation comes at a cost – each request ... -
A Case for Protecting Huge Pages from the Kernel
(2018-01-01)Modern architectures support multiple size pages to facilitate applications that use large chunks of contiguous memory either for buffer allocation, application specific memory management, in-memory caching or garbage ... -
CHARGE: Accelerating GNN Training via CPU Sampling in Heterogeneous CPU–GPU Environment
Graph Neural Networks (GNNs) have demonstrated exceptional performance across a wide range of applications, driving their widespread adoption. Current frameworks employ CPU and GPU resources—either in isolation or ... -
Checking Compatability of Programs on Shared Data
(2018-07-28)A large software system is built by composing multiple programs, possibly developed independently. The component programs communicate by sharing data. Data sharing involves creation of instances of the shared data by one ... -
Checking Observational Purity of Procedures
We provide two static analysis approaches(using theorem proving) that check if a given (recursive) procedure behaves as if it were stateless, even when it maintains state in global variables. In other words, we check if ...