Searcharxiv⌕ Search

arXiv subjects

Tal Kachman

Publications and source records attributed to Tal Kachman.

23 records · Page 2Linked to original sources

Novel Uncertainty Framework for Deep Learning Ensembles

Deep neural networks have become the default choice for many of the machine learning tasks such as classification and regression. Dropout, a method commonly used to improve the convergence of deep neural networks, generates an ensemble of thinned networks with extensive weight sharing. Recent studies that dropout can be viewed as an approximate variational inference in Gaussian processes, and used as a practical tool to obtain uncertainty estimates of the network. We propose a novel statistical mechanics based framework to dropout and use this framework to propose a new generic algorithm that focuses on estimates of the variance of the loss as measured by the ensemble of thinned networks. Our approach can be applied to a wide range of deep neural network architectures and machine learning tasks. In classification, this algorithm allows the generation of a don't-know answer to be generated, which can increase the reliability of the classifier. Empirically we demonstrate state-of-the-art AUC results on publicly available benchmarks.

stat.ML↗

Learning multiple non-mutually-exclusive tasks for improved classification of inherently ordered labels

Medical image classification involves thresholding of labels that represent malignancy risk levels. Usually, a task defines a single threshold, and when developing computer-aided diagnosis tools, a single network is trained per such threshold, e.g. as screening out healthy (very low risk) patients to leave possibly sick ones for further analysis (low threshold), or trying to find malignant cases among those marked as non-risk by the radiologist ("second reading", high threshold). We propose a way to rephrase the classification problem in a manner that yields several problems (corresponding to different thresholds) to be solved simultaneously. This allows the use of Multiple Task Learning (MTL) methods, significantly improving the performance of the original classifier, by facilitating effective extraction of information from existing data.

cs.CV↗

Numerical implementation of the multiscale and averaging methods for quasi periodic systems

We consider the problem of numerically solving the Schrödinger equation with a potential that is quasi periodic in space and time. We introduce a numerical scheme based on a newly developed multi-time scale and averaging technique. We demonstrate that with this novel method we can solve efficiently and with rigorous control of the error such an equation for long times. A comparison with the standard split-step method shows substantial improvement in computation times, besides the controlled errors. We apply this method for a free particle driven by quasi-periodic potential with many frequencies. The new method makes it possible to evolve the Schrodinger equation for times much longer than was possible so far and to conclude that there are regimes where the energy growth stops in-spite of the driving.

nlin.CD↗

Dynamics of a Classical Particle in a Quasi Periodic Potential

We study the dynamics of a one-dimensional classical particle in a space and time dependent potential with randomly chosen parameters. The focus of this work is a quasi-periodic potential, which only includes a finite number of Fourier components. The momentum is calculated analytically for short time within a self-consistent approximation, under certain conditions. We find that the dynamics can be described by a model of a random walk between the Chirikov resonances, which are resonances between the particle momentum and the Fourier components of the potential. We use numerical methods to test these results and to evaluate the important properties, such as the characteristic hopping time between the resonances. This work sheds light on the short time dynamics induced by potentials which are relevant for optics and atom optics.

cond-mat.stat-mech↗

Computer vision-based recognition of liquid surfaces and phase boundaries in transparent vessels, with emphasis on chemistry applications

The ability to recognize the liquid surface and the liquid level in transparent containers is perhaps the most commonly used evaluation method when dealing with fluids. Such recognition is essential in determining the liquid volume, fill level, phase boundaries and phase separation in various fluid systems. The recognition of liquid surfaces is particularly important in solution chemistry, where it is essential to many laboratory techniques (e.g., extraction, distillation, titration). A general method for the recognition of interfaces between liquid and air or between phase-separating liquids could have a wide range of applications and contribute to the understanding of the visual properties of such interfaces. This work examines a computer vision method for the recognition of liquid surfaces and liquid levels in various transparent containers. The method can be applied to recognition of both liquid-air and liquid-liquid surfaces. No prior knowledge of the number of phases is required. The method receives the image of the liquid container and the boundaries of the container in the image and scans all possible curves that could correspond to the outlines of liquid surfaces in the image. The method then compares each curve to the image to rate its correspondence with the outline of the real liquid surface by examining various image properties in the area surrounding each point of the curve. The image properties that were found to give the best indication of the liquid surface are the relative intensity change, the edge density change and the gradient direction relative to the curve normal.

cs.CV↗