Extensions by Antiderivatives, Exponentials of Integrals and by Iterated Logarithms

Let F be a characteristic zero differential field with an algebraically closed field of constants, E be a no-new-constant extension of F by antiderivatives of F and let y1, ..., yn be antiderivatives of E. The antiderivatives y1, ..., yn of E are called J-I-E antiderivatives if the derivatives of yi in E satisfies certain conditions. We will discuss a new proof for the Kolchin-Ostrowski theorem and generalize this theorem for a tower of extensions by J-I-E antiderivatives and use this generalized version of the theorem to classify the finitely differentially generated subfields of this tower. In the process, we will show that the J-I-E antiderivatives are algebraically independent over the ground differential field. An example of a J-I-E tower is extensions by iterated logarithms. We will discuss the normality of extensions by iterated logarithms and produce an algorithm to compute its finitely differentially generated subfields.Comment: 66 pages, 1 figur

Iterated Antiderivative Extensions

Let $F$ be a characteristic zero differential field with an algebraically closed field of constants and let $E$ be a no new constants extension of $F$. We say that $E$ is an \textsl{iterated antiderivative extension} of $F$ if $E$ is a liouvillian extension of $F$ obtained by adjoining antiderivatives alone. In this article, we will show that if $E$ is an iterated antiderivative extension of $F$ and $K$ is a differential subfield of $E$ that contains $F$ then $K$ is an iterated antiderivative extension of $F$.Comment: 15 pages, 0 figure

Linear differential equations and Hurwitz series

In this article, we study the set of all solutions of linear differential equations using Hurwitz series. We first obtain explicit recursive expressions for solutions of such equations and study the group of differential automorphisms of the set of all solutions. Moreover, we give explicit formulas that compute the group of differential automorphisms. We require neither that the underlying field be algebraically closed nor that the characteristic of the field be zero

Light Field Blind Motion Deblurring

We study the problem of deblurring light fields of general 3D scenes captured under 3D camera motion and present both theoretical and practical contributions. By analyzing the motion-blurred light field in the primal and Fourier domains, we develop intuition into the effects of camera motion on the light field, show the advantages of capturing a 4D light field instead of a conventional 2D image for motion deblurring, and derive simple methods of motion deblurring in certain cases. We then present an algorithm to blindly deblur light fields of general scenes without any estimation of scene geometry, and demonstrate that we can recover both the sharp light field and the 3D camera motion path of real and synthetically-blurred light fields.Comment: To be presented at CVPR 201

On the Analysis of Trajectories of Gradient Descent in the Optimization of Deep Neural Networks

Theoretical analysis of the error landscape of deep neural networks has garnered significant interest in recent years. In this work, we theoretically study the importance of noise in the trajectories of gradient descent towards optimal solutions in multi-layer neural networks. We show that adding noise (in different ways) to a neural network while training increases the rank of the product of weight matrices of a multi-layer linear neural network. We thus study how adding noise can assist reaching a global optimum when the product matrix is full-rank (under certain conditions). We establish theoretical foundations between the noise induced into the neural network - either to the gradient, to the architecture, or to the input/output to a neural network - and the rank of product of weight matrices. We corroborate our theoretical findings with empirical results.Comment: 4 pages + 1 figure (main, excluding references), 5 pages + 4 figures (appendix

ADINE: An Adaptive Momentum Method for Stochastic Gradient Descent

Two major momentum-based techniques that have achieved tremendous success in optimization are Polyak's heavy ball method and Nesterov's accelerated gradient. A crucial step in all momentum-based methods is the choice of the momentum parameter $m$ which is always suggested to be set to less than $1$. Although the choice of $m < 1$ is justified only under very strong theoretical assumptions, it works well in practice even when the assumptions do not necessarily hold. In this paper, we propose a new momentum based method $\textit{ADINE}$, which relaxes the constraint of $m < 1$ and allows the learning algorithm to use adaptive higher momentum. We motivate our hypothesis on $m$ by experimentally verifying that a higher momentum ($\ge 1$) can help escape saddles much faster. Using this motivation, we propose our method $\textit{ADINE}$ that helps weigh the previous updates more (by setting the momentum parameter $> 1$), evaluate our proposed algorithm on deep neural networks and show that $\textit{ADINE}$ helps the learning algorithm to converge much faster without compromising on the generalization error.Comment: 8 + 1 pages, 12 figures, accepted at CoDS-COMAD 201

Learning to Synthesize a 4D RGBD Light Field from a Single Image

We present a machine learning algorithm that takes as input a 2D RGB image and synthesizes a 4D RGBD light field (color and depth of the scene in each ray direction). For training, we introduce the largest public light field dataset, consisting of over 3300 plenoptic camera light fields of scenes containing flowers and plants. Our synthesis pipeline consists of a convolutional neural network (CNN) that estimates scene geometry, a stage that renders a Lambertian light field using that geometry, and a second CNN that predicts occluded rays and non-Lambertian effects. Our algorithm builds on recent view synthesis methods, but is unique in predicting RGBD for each light field ray and improving unsupervised single image depth estimation by enforcing consistency of ray depths that should intersect the same scene point. Please see our supplementary video at https://youtu.be/yLCvWoQLnmsComment: International Conference on Computer Vision (ICCV) 201

Need a Lift? An Elevator Queueing Problem

Various aspects of the behavior and dispatching of elevators (lifts) were studied. Monte Carlo simulation was used to study the statistics of the several models for the peak demand at uppeak times. Analytical models problems were used to prove or disprove whether schemes were optimal. A mostly integer programming problem was formulated but not studied further