Softweb Solutions offers advanced machine learning solutions to help organizations in solving key business challenges, enabling data-driven decision making, and creating innovative business models. We create future-ready ML-powered applications by using techniques like pattern recognition, computational intelligence, nature-inspired algorithms, and mathematical optimization. We help you explore the possibilities of machine learning for your business growth, and then create cutting-edge solutions to take its fullest advantage.

We use Artificial Intelligence algorithms to help machines learn themselves from the data they are exposed to and arrive at conclusions, simulating human intelligence. Our data scientist have profound knowledge and experience in designing, implementing and integrating artificial intelligence applications specific to customers business. Most of the organizations don't have their data science team, which is true for not just startups but also for large organizations. Our motive is to fill this gap by providing technical expertise and know-how to your project from the day one. We provide a team of best data scientist who would help you overcome challenges faced by you in data planning.

ICCV 2019 today announced its Best Paper Awards in three categories. The ICCV (IEEE International Conference on Computer Vision) is a top international biannual computer vision gathering comprising a main conference and several co-located workshops and tutorials. ICCV 2019 received 4,303 papers -- more than twice the number submitted to ICCV 2017 -- and accepted 1,075, for a reception rate of roughly 25 percent. Abstract: We introduce SinGAN, an unconditional generative model that can be learned from a single natural image. Our model is trained to capture the internal distribution of patches within the image, and is then able to generate high quality, diverse samples that carry the same visual content as the image.

In 2014, few of us worked at the intersection of deep learning and genomics. Three years later, genomics is in the midst of a paradigm shift -- deep learning for genomics is coming. How did we get here? In late 2014, we developed our first working deep learning for genomics model -- the "Chromputer". Chromputer used CNNs similar to AlexNet to predict histone modifications and chromatin states from 2D DNA accessibility data (ATAC-seq).

In a self-congratulatory mood, I announced, "You know, I have a dinner date today with Mr Kaushal... my student." My better half replied, "Yes, we know. My grandson, studying in class IX, said sarcastically, "Enjoy your dinner, grandpa. Teachers' Day dinners are not going to last long." Indignant and a little annoyed, I asked, "What do you mean?" "Sorry, grandpa.

In a self-congratulatory mood, I announced, "You know, I have a dinner date today with Mr Kaushal... my student." My better half replied, "Yes, we know. My grandson, studying in class IX, said sarcastically, "Enjoy your dinner, grandpa. Teachers' Day dinners are not going to last long." Indignant and a little annoyed, I asked, "What do you mean?" "Sorry, grandpa.

Abstract-- We develop algorithms with low regret for learning episodic Markov decision processes based on kernel approximation techniques. The algorithms are based on both the Upper Confidence Bound (UCB) as well as Posterior or Thompson Sampling (PSRL) philosophies, and work in the general setting of continuous state and action spaces when the true unknown transition dynamics are assumed to have smoothness induced by an appropriate Reproducing Kernel Hilbert Space (RKHS). I. INTRODUCTION The goal of reinforcement learning (RL) is to learn optimal behavior by repeated interaction with an unknown environment, usually modeled as a Markov Decision Process (MDP). Performance is typically measured by the amount of interaction, in terms of episodes or rounds, needed to arriv e at an optimal (or near-optimal) policy; this is also known as the sample complexity of RL [1]. The sample complexity objective encourages efficient exploration across states a nd actions, but, at the same time, is indifferent to the reward earned during the learning phase.

Predicting the runtime complexity of a programming code is an arduous task. In fact, even for humans, it requires a subtle analysis and comprehensive knowledge of algorithms to predict time complexity with high fidelity, given any code. As per Turing's Halting problem proof, estimating code complexity is mathematically impossible. Nevertheless, an approximate solution to such a task can help developers to get real-time feedback for the efficiency of their code. In this work, we model this problem as a machine learning task and check its feasibility with thorough analysis. Due to the lack of any open source dataset for this task, we propose our own annotated dataset CoRCoD: Code Runtime Complexity Dataset, extracted from online judges. We establish baselines using two different approaches: feature engineering and code embeddings, to achieve state of the art results and compare their performances. Such solutions can be widely useful in potential applications like automatically grading coding assignments, IDE-integrated tools for static code analysis, and others.

Federated learning (FL) rests on the notion of training a global model in a decentralized manner. Under this setting, mobile devices perform computations on their local data before uploading the required updates to improve the global model. However, when the participating clients implement an uncoordinated computation strategy, the difficulty is to handle the communication efficiency (i.e., the number of communications per iteration) while exchanging the model parameters during aggregation. Therefore, a key challenge in FL is how users participate to build a high-quality global model with communication efficiency. We tackle this issue by formulating a utility maximization problem, and propose a novel crowdsourcing framework to leverage FL that considers the communication efficiency during parameters exchange. First, we show an incentive-based interaction between the crowdsourcing platform and the participating client's independent strategies for training a global learning model, where each side maximizes its own benefit. We formulate a two-stage Stackelberg game to analyze such scenario and find the game's equilibria. Second, we formalize an admission control scheme for participating clients to ensure a level of local accuracy. Simulated results demonstrate the efficacy of our proposed solution with up to 22 % gain in the offered reward. A preliminary version of this paper has been accepted at IEEE GLOBECOM [1]. Nguyen H. Tran is with the School of Computer Science, The University of Sydney, NSW 2006, Australia, email: nguyen.tran@sydney.edu.au. Mehdi Bennis is with the Center for Wireless Communications, University of Oulu, 90014 Oulu, Finland, email: mehdi.bennis@oulu.fi. I NTRODUCTION A. Background and motivation Recent years have admittedly witnessed a tremendous growth in the use of Machine Learning (ML) techniques and its applications in mobile devices. On one hand, according to International Data Corporation, the shipments of smartphones reached 3 billions in 2018 [2], which implies a large crowd of mobile users generating personalized data via the interaction with mobile applications, or with the use of inbuilt sensors (e.g., cameras, microphones and GPS) exploited efficiently by mobile crowdsensing paradigm (e.g., for indoor localization, traffic monitoring, navigation [3], [4], [5], [6]). On the other hand, mobile devices are getting empowered extensively with specialized hardware architectures and computing engines such as the CPU, GPU and DSP (e.g., energy efficient Qualcomm Hexagon V ector eXtensions on Snapdragon 835 [7]) for solving diverse machine learning problems. Gartner predicts that 80 percent of smartphones will have on-device AI capabilities by 2022.

When an online learning algorithm is used to estimate the unknown parameters of a model, the signals interacting with the parameter estimates should not decay too quickly for the optimal values to be discovered correctly. This requirement is referred to as persistency of excitation, and it arises in various contexts, such as optimization with stochastic gradient methods, exploration for multi-armed bandits, and adaptive control of dynamical systems. While training a neural network, the iterative optimization algorithm involved also creates an online learning problem, and consequently, correct estimation of the optimal parameters requires persistent excitation of the network weights. In this work, we analyze the dynamics of the gradient descent algorithm while training a two-layer neural network with two different loss functions, the squared-error loss and the cross-entropy loss; and we obtain conditions to guarantee persistent excitation of the network weights. We then show that these conditions are difficult to satisfy when a multi-layer network is trained for a classification task, for the signals in the intermediate layers of the network become low-dimensional during training and fail to remain persistently exciting. To provide a remedy, we delve into the classical regularization terms used for linear models, reinterpret them as a means to ensure persistent excitation of the model parameters, and propose an algorithm for neural networks by building an analogy. The results in this work shed some light on why adversarial examples have become a challenging problem for neural networks, why merely augmenting training data sets will not be an effective approach to address them, and why there may not exist a data-independent regularization term for neural networks, which involve only the model parameters but not the training data.