Neural Information Processing Systems http://nips.cc/

Graph matching plays a central role in such fields as computer vision, pattern recognition, and bioinformatics. Graph matching problems can be cast as two types of quadratic assignment problems (QAPs): Koopmans-Beckmann's QAP or Lawler's QAP. In our paper, we provide a unifying view for these two problems by introducing new rules for array operations in Hilbert spaces. Consequently, Lawler's QAP can be considered as the Koopmans-Beckmann's alignment between two arrays in reproducing kernel Hilbert spaces (RKHS), making it possible to efficiently solve the problem without computing a huge affinity matrix. Furthermore, we develop the entropy-regularized Frank-Wolfe (EnFW) algorithm for optimizing QAPs, which has the same convergence rate as the original FW algorithm while dramatically reducing the computational burden for each outer iteration. We conduct extensive experiments to evaluate our approach, and show that our algorithm significantly outperforms the state-of-the-art in both matching accuracy and scalability.

In this paper, we show that a large family of functions, defined as Separable Functions, can asymptotically approximate the discrete matching problem by varying the approximation controlling parameters.

Tesla is being investigated by the US government after reports the firm's self-driving cars had broken traffic laws, including driving on the wrong side of the road and not stopping for red lights. It said it was aware of 58 reports where the electric cars had committed such violations, according to a filing from the National Highway Traffic Safety Administration (NHTSA). An estimated 2.9 million cars equipped with full self-driving tech will fall under the investigation. Tesla, whose boss Elon Musk recently became the world's first half-trillionaire, has been approached for comment. The NHTSA's preliminary evaluation will assess the scope, frequency, and potential safety consequences of the Full Self-Driving (Supervised) mode.

Neural Information Processing Systems http://nips.cc/

Sign up for the Slatest to get the most insightful analysis, criticism, and advice out there, delivered to your inbox daily. Bryan Kohberger is accused of committing an unspeakably evil act, stabbing to death four University of Idaho students in their off-campus home in November 2022. The killings were brutal, and as soon as Kohberger was arrested, some members of the victims' families demanded that he should be executed if he is convicted. Kohberger is due to stand trial in August. In the run-up to that trial, his defense lawyers have filed a flurry of motions challenging various aspects of the prosecution's case. Filing such motions is standard in death cases, though in Kohberger's case, the defense and prosecution have done much of that work in secret.

Graph matching plays a central role in such fields as computer vision, pattern recognition, and bioinformatics. Graph matching problems can be cast as two types of quadratic assignment problems (QAPs): Koopmans-Beckmann's QAP or Lawler's QAP. In our paper, we provide a unifying view for these two problems by introducing new rules for array operations in Hilbert spaces. Consequently, Lawler's QAP can be considered as the Koopmans-Beckmann's alignment between two arrays in reproducing kernel Hilbert spaces (RKHS), making it possible to efficiently solve the problem without computing a huge affinity matrix. Furthermore, we develop the entropy-regularized Frank-Wolfe (EnFW) algorithm for optimizing QAPs, which has the same convergence rate as the original FW algorithm while dramatically reducing the computational burden for each outer iteration.

Why are those leading adopters so far ahead -- and what can others learn from them? MIT Machine Intelligence for Manufacturing and Operations (MIMO) and McKinsey and Company have the answer, revealed in a first-of-its-kind Harvard Business Review article. The piece chronicles how MIMO and McKinsey partnered for a sweeping 100-company survey to explain how high-performing companies successfully wield machine learning technologies (and where others could improve). Created by the MIT Leaders for Global Operations (LGO) program, MIMO is a research and educational program designed to boost industrial competitiveness by accelerating machine intelligence's deployment and understanding. The goal is to "find the shortest path from data to impact," says managing director Bruce Lawler SM '92.

In this paper, we investigate the use of deep learning for solving a classical NP-Hard single machine scheduling problem where the criterion is to minimize the total tardiness. Instead of designing an end-to-end machine learning model, we utilize well known decomposition of the problem and we enhance it with a data-driven approach. We have designed a regressor containing a deep neural network that learns and predicts the criterion of a given set of jobs. The network acts as a polynomial-time estimator of the criterion that is used in a single-pass scheduling algorithm based on Lawler's decomposition theorem. Essentially, the regressor guides the algorithm to select the best position for each job. The experimental results show that our data-driven approach can efficiently generalize information from the training phase to significantly larger instances (up to 350 jobs) where it achieves an optimality gap of about 0.5%, which is four times less than the gap of the state-of-the-art NBR heuristic.

Graph matching plays a central role in such fields as computer vision, pattern recognition, and bioinformatics. Graph matching problems can be cast as two types of quadratic assignment problems (QAPs): Koopmans-Beckmann's QAP or Lawler's QAP. In our paper, we provide a unifying view for these two problems by introducing new rules for array operations in Hilbert spaces. Consequently, Lawler's QAP can be considered as the Koopmans-Beckmann's alignment between two arrays in reproducing kernel Hilbert spaces (RKHS), making it possible to efficiently solve the problem without computing a huge affinity matrix. Furthermore, we develop the entropy-regularized Frank-Wolfe (EnFW) algorithm for optimizing QAPs, which has the same convergence rate as the original FW algorithm while dramatically reducing the computational burden for each outer iteration.