1 code implementation • 17 Feb 2023 • Vivek Nair, Wenbo Guo, Justus Mattern, Rui Wang, James F. O'Brien, Louis Rosenberg, Dawn Song
With the recent explosive growth of interest and investment in virtual reality (VR) and the so-called "metaverse," public attention has rightly shifted toward the unique security and privacy threats that these platforms may pose.
no code implementations • 8 Aug 2022 • Moritz Beller, Hongyu Li, Vivek Nair, Vijayaraghavan Murali, Imad Ahmad, Jürgen Cito, Drew Carlson, Ari Aye, Wes Dyer
Catching and attributing code change-induced performance regressions in production is hard; predicting them beforehand, even harder.
2 code implementations • 1 Nov 2019 • Rahul Krishna, Vivek Nair, Pooyan Jamshidi, Tim Menzies
To resolve these problems, we propose a novel transfer learning framework called BEETLE, which is a "bellwether"-based transfer learner that focuses on identifying and learning from the most relevant source from amongst the old data.
Software Engineering
no code implementations • 29 Jul 2018 • Huy Tu, Vivek Nair
Hyperparameter tuning is the black art of automatically finding a good combination of control parameters for a data miner.
3 code implementations • 11 Mar 2018 • Vivek Nair, Rahul Krishna, Tim Menzies, Pooyan Jamshidi
Using this insight, this paper proposes BEETLE, a novel bellwether based transfer learning scheme, which can identify a suitable source and use it to find near-optimal configurations of a software system.
Software Engineering
1 code implementation • 7 Jan 2018 • Vivek Nair, Zhe Yu, Tim Menzies, Norbert Siegmund, Sven Apel
FLASH scales up to software systems that defeat the prior state of the art model-based methods in this area.
Software Engineering
no code implementations • 27 Jan 2017 • Vivek Nair, Tim Menzies, Norbert Siegmund, Sven Apel
Despite the huge spread and economical importance of configurable software systems, there is unsatisfactory support in utilizing the full potential of these systems with respect to finding performance-optimal configurations.
no code implementations • 27 Jan 2017 • Jianfeng Chen, Vivek Nair, Tim Menzies
Context: Evolutionary algorithms typically require a large number of evaluations (of solutions) to converge - which can be very slow and expensive to evaluate. Objective: To solve search-based software engineering (SE) problems, using fewer evaluations than evolutionary methods. Method: Instead of mutating a small population, we build a very large initial population which is then culled using a recursive bi-clustering chop approach.
no code implementations • 8 Sep 2016 • Wei Fu, Vivek Nair, Tim Menzies
In software analytics, at least for defect prediction, several methods, like grid search and differential evolution (DE), have been proposed to learn these parameters, which has been proved to be able to improve the performance scores of learners.