Merging datafiles containing information on overlapping sets of entities is a challenging task in the absence of unique identifiers, and is further complicated when some entities are duplicated in the datafiles. Most approaches to this problem have focused on linking two files assumed to be free of duplicates, or on detecting which records in a single file are duplicates. However, it is common in practice to encounter scenarios that fit somewhere in between or beyond these two settings. We propose a Bayesian approach for the general setting of multifile record linkage and duplicate detection. We use a novel partition representation to propose a structured prior for partitions that can incorporate prior information about the data collection processes of the datafiles in a flexible manner, and extend previous models for comparison data to accommodate the multifile setting. We also introduce a family of loss functions to derive Bayes estimates of partitions that allow uncertain portions of the partitions to be left unresolved. The performance of our proposed methodology is explored through extensive simulations. Code implementing the methodology is available at https://github.com/aleshing/multilink .

Creating labeled training sets has become one of the major roadblocks in machine learning. To address this, recent Weak Supervision (WS) frameworks synthesize training labels from multiple potentially noisy supervision sources. However, existing frameworks are restricted to supervision sources that share the same output space as the target task. To extend the scope of usable sources, we formulate Weak Indirect Supervision (WIS), a new research problem for automatically synthesizing training labels based on indirect supervision sources that have different output label spaces. To overcome the challenge of mismatched output spaces, we develop a probabilistic modeling approach, PLRM, which uses user-provided label relations to model and leverage indirect supervision sources. Moreover, we provide a theoretically-principled test of the distinguishability of PLRM for unseen labels, along with an generalization bound. On both image and text classification tasks as well as an industrial advertising application, we demonstrate the advantages of PLRM by outperforming baselines by a margin of 2%-9%.

Probabilistic programming provides numerous advantages Ideally speaking, a good recommendations system should be over other techniques, including but not able to identify and remove malicious users before they can limited to providing a disentangled representation disrupt the ranking system by a significant margin. However, of how malicious users acted under a structured to eliminate the risk of false positives a resilient ranking model, as well as allowing for the quantification system can use as much data as possible. So we have to of damage caused by malicious users. We show adjust the tradeoff between false positives and the damage a experiments in malicious user identification using set of malicious users can cause to a ranking system.

Tech giant Google is going to try and make some of its software more environment friendly. In a slew of updates announced today, the company said software like Maps and Search will start showing results that are meant to steer people towards environment friendly options. For instance, users in the US will not only see the fastest route to a destination on Google Maps, but the app will also show the most fuel-efficient route. The company said it is using artificial intelligence (AI) and insights from the US Department of Energy's National Renewable Energy Laboratory (NREL) to provide eco-friendly routes on Android and iOS versions of Maps. The feature is available only in the US right now and will come to Europe next year.

Poorly timed traffic lights don't just waste precious minutes. Like Google's chief sustainability officer Kate Brandt pointed out at a media event yesterday, they're also bad for the environment and public health. The company unveiled a slew of sustainability-centric products and updates today that aim to help users make more informed, environmentally friendly decisions. But it's also been working on a project that could use AI to make traffic lights more efficient and, as a result, decrease pollution in general. When your vehicle stops at an intersection, that idling time leads to wasted fuel and "more street-level air pollution," Brandt said.

Depth estimation-based obstacle avoidance has been widely adopted by autonomous systems (drones and vehicles) for safety purpose. It normally relies on a stereo camera to automatically detect obstacles and make flying/driving decisions, e.g., stopping several meters ahead of the obstacle in the path or moving away from the detected obstacle. In this paper, we explore new security risks associated with the stereo vision-based depth estimation algorithms used for obstacle avoidance. By exploiting the weaknesses of the stereo matching in depth estimation algorithms and the lens flare effect in optical imaging, we propose DoubleStar, a long-range attack that injects fake obstacle depth by projecting pure light from two complementary light sources. DoubleStar includes two distinctive attack formats: beams attack and orbs attack, which leverage projected light beams and lens flare orbs respectively to cause false depth perception. We successfully attack two commercial stereo cameras designed for autonomous systems (ZED and Intel RealSense). The visualization of fake depth perceived by the stereo cameras illustrates the false stereo matching induced by DoubleStar. We further use Ardupilot to simulate the attack and demonstrate its impact on drones. To validate the attack on real systems, we perform a real-world attack towards a commercial drone equipped with state-of-the-art obstacle avoidance algorithms. Our attack can continuously bring a flying drone to a sudden stop or drift it away across a long distance under various lighting conditions, even bypassing sensor fusion mechanisms. Specifically, our experimental results show that DoubleStar creates fake depth up to 15 meters in distance at night and up to 8 meters during the daytime. To mitigate this newly discovered threat, we provide discussions on potential countermeasures to defend against DoubleStar.

We study the privacy implications of deploying recurrent neural networks in machine learning. We consider membership inference attacks (MIAs) in which an attacker aims to infer whether a given data record has been used in the training of a learning agent. Using existing MIAs that target feed-forward neural networks, we empirically demonstrate that the attack accuracy wanes for data records used earlier in the training history. Alternatively, recurrent networks are specifically designed to better remember their past experience; hence, they are likely to be more vulnerable to MIAs than their feed-forward counterparts. We develop a pair of MIA layouts for two primary applications of recurrent networks, namely, deep reinforcement learning and sequence-to-sequence tasks. We use the first attack to provide empirical evidence that recurrent networks are indeed more vulnerable to MIAs than feed-forward networks with the same performance level. We use the second attack to showcase the differences between the effects of overtraining recurrent and feed-forward networks on the accuracy of their respective MIAs. Finally, we deploy a differential privacy mechanism to resolve the privacy vulnerability that the MIAs exploit. For both attack layouts, the privacy mechanism degrades the attack accuracy from above 80% to 50%, which is equal to guessing the data membership uniformly at random, while trading off less than 10% utility.

The solution of multistage stochastic linear problems (MSLP) represents a challenge for many applications. Long-term hydrothermal dispatch planning (LHDP) materializes this challenge in a real-world problem that affects electricity markets, economies, and natural resources worldwide. No closed-form solutions are available for MSLP and the definition of non-anticipative policies with high-quality out-of-sample performance is crucial. Linear decision rules (LDR) provide an interesting simulation-based framework for finding high-quality policies to MSLP through two-stage stochastic models. In practical applications, however, the number of parameters to be estimated when using an LDR may be close or higher than the number of scenarios, thereby generating an in-sample overfit and poor performances in out-of-sample simulations. In this paper, we propose a novel regularization scheme for LDR based on the AdaLASSO (adaptive least absolute shrinkage and selection operator). The goal is to use the parsimony principle as largely studied in high-dimensional linear regression models to obtain better out-of-sample performance for an LDR applied to MSLP. Computational experiments show that the overfit threat is non-negligible when using the classical non-regularized LDR to solve MSLP. For the LHDP problem, our analysis highlights the following benefits of the proposed framework in comparison to the non-regularized benchmark: 1) significant reductions in the number of non-zero coefficients (model parsimony), 2) substantial cost reductions in out-of-sample evaluations, and 3) improved spot-price profiles.

I am regularly asked to summarize my many posts. I thought it would be a good idea to publish on this blog, every Monday, some of the most relevant articles that I have already shared with you on my social networks. Today I will share some of the most relevant articles about Artificial Intelligence and in what form you can find it in today's life. I will also comment on the articles. People tend to desire changes, and that includes changes to their surrounding home spaces.

An exploratory survey of the key coordinates of the Enterprise Artificial Intelligence (AI) market strategically describes multiple aspects of the industry through a systematically organised data representation followed by extracting deepest information from various reliable sources. It compiles a series of statistically significant data explaining the Enterprise Artificial Intelligence (AI) market size and volume ratios coupled with the market infrastructure specifications delivering the market estimation and metrics along with industry valuation. The study intends to deliver an all-inclusive market analysis offering optimum client satisfaction. It delivers a highly informative and relevant market study offering valuable insights into the Enterprise Artificial Intelligence (AI) market growth and development. The forecast represented in the market study helps picture the growth predictions realistically determined based on current growth determinants.