Research
On-device research index

arXiv research

A locally-built, LLM-digested index of recent arXiv papers in quant finance, geometry/topology, and statistical ML — keyword search served straight from SQLite on this machine.

168,742 papers · 148 categories

Trend · papers per month

8152330 · May 202619922001200920172026
48 results for film scheduling

Solves the film scheduling and staggered showtimes problem for movie theaters.

problem Maximize attendance and revenue by scheduling films with staggered showtimes.
method Binary integer linear optimization to find optimal schedules for each cluster of neighboring locations.
result Optimal scheduling cannot be done for all locations at once, but must be done for each cluster.

In this paper we first review the covering space method with constrained BV functions for solving the classical Plateau's problem. Next, we carefully analyze some interesting examples of soap films compatible with the covering space method: in particular, the case of a soap film only partially wetting a space curve, a …

2017-10-03abs ↗pdf ↗

Multi-layer optical film has been found to afford important applications in optical communication, optical absorbers, optical filters, etc. Different algorithms of multi-layer optical film design has been developed, as simplex method, colony algorithm, genetic algorithm. These algorithms rapidly promote the design and …

2018-12-07abs ↗pdf ↗

In this paper we provide the first examples of non-flat soap films proven to span tetrahedra. These are members of a continuous two parameter family of soap films with tetrahedral boundaries. Of particular interest is a two parameter subfamily where each spanning soap film has the property that two minimal surfaces mee…

2008-09-02abs ↗pdf ↗

Derives equilibrium law for Plateau borders in wet soap films and foams.

problem Equilibrium law for Plateau borders in wet foams and films.
method Rigorous derivation using Gauss' capillarity theory, homotopic spanning condition, and effective compactness theorems.
result Sharp regularity properties of energy minimizers for Plateau borders in wet foams and films.

Recent breakthroughs in computer vision and natural language processing have spurred interest in challenging multi-modal tasks such as visual question-answering and visual dialogue. For such tasks, one successful approach is to condition image-based convolutional network computation on language via Feature-wise Linear …

2018-08-03abs ↗pdf ↗

We introduce a general-purpose conditioning method for neural networks called FiLM: Feature-wise Linear Modulation. FiLM layers influence neural network computation via a simple, feature-wise affine transformation based on conditioning information. We show that FiLM layers are highly effective for visual reasoning - an…

2017-09-22abs ↗pdf ↗

We prove existence and a.e. regularity of an area minimizing soap film with a bound on energy spanning a given Jordan curve in R^3. The energy of a film is defined to be the sum of its surface area and the length of its singular branched set. The class of surfaces over which area is minimized includes images of disks, …

2004-03-20abs ↗pdf ↗

A soap film is actually a thin solid fluid bounded by two surfaces of opposite orientation. It is natural to model the film using one polyhedron for each side. Two problems are to get the polyhedra for both sides to be in the same place without canceling each other out and to model triple junctions without introducing …

2004-01-03abs ↗pdf ↗

What are the possible shapes of various things and why? For instance, when a closed wire or a frame is dipped into a soap solution and is raised up from the solution, the surface spanning the wire is a soap film. What are the possible shapes of soap films and why? Or, for instance, why is DNA like a double spiral stair…

2002-08-23abs ↗pdf ↗

This paper presents a new Graph Neural Network (GNN) type using feature-wise linear modulation (FiLM). Many standard GNN variants propagate information along the edges of a graph by computing "messages" based only on the representation of the source of each edge. In GNN-FiLM, the representation of the target node of an…

2019-06-28abs ↗pdf ↗

FiLM improves deep learning for long-term time series forecasting.

problem Preserving historical information without overfitting noise.
method Applies Legendre Polynomials and Fourier projections, adds low-rank approximation.
result Significantly improves multivariate and univariate forecasting accuracy.

We develop a theory of axisymmetric surfaces minimizing a combination of surface tension and nematic elastic energies which may be suitable for describing simple film and bubble shapes. As a function of the elastic constant and the applied tension on the bubbles, we find the analogues of the unduloid, sphere, and nodoi…

2008-11-13abs ↗pdf ↗

Plateau's soap film problem is to find a surface of least area spanning a given boundary. We begin with a compact orientable (n2)(n-2)-dimensional submanifold MM of Rn\R^n. If MM is connected, we say a compact set XX "spans" MM if XX intersects every Jordan curve whose linking number with MM is 1. Picture a soap fi…

2013-10-01abs ↗pdf ↗

Improved continual learning method using variational inference and FiLM layers.

problem Training models on new tasks and datasets in an online fashion.
method Generalized Variational Continual Learning (GVCL) with likelihood-tempering and FiLM layers.
result GVCL outperforms existing baselines in both small and large datasets, providing better calibration.

Motivated by the study of the equilibrium equations for a soap film hanging from a wire frame, we prove a compactness theorem for surfaces with asymptotically vanishing mean curvature and fixed or converging boundaries. In particular, we obtain sufficient geometric conditions for the minimal surfaces spanned by a given…

2018-07-13abs ↗pdf ↗

New method finds all thin film structures from reflectometry data.

problem Computational prohibitive for standard algorithms, leading to unreliable analysis.
method Prior-Amortized Neural Posterior Estimation (PANPE) combining simulation-based inference and adaptive priors.
result Identifies all realistic structures in seconds, setting new standards in reflectometry.

In mathematics, the classical Plateau problem consists of finding the surface of least area that spans a given rigid boundary curve. A physical realization of the problem is obtained by dipping a stiff wire frame of some given shape in soapy water and then removing it; the shape of the spanning soap film is a solution …

2011-08-02abs ↗pdf ↗

This paper proposes a method to select project schedules with the lowest risk.

problem Selecting schedules that meet project deadlines while minimizing risk.
method Integrating aleatory uncertainty into project scheduling to quantify and compare risks.
result Proposes a method to select schedules with the lowest risk.

Machine learning speeds up FLIM analysis in biomedical research.

problem Complex, slow, and computationally expensive FLIM analysis.
method Machine learning techniques for faster and smarter FLIM data extraction and interpretation.
result Higher accuracy in classifying and segmenting FLIM images compared to conventional methods.

ScheduleFree+ improves large language model training without schedules or learning rates.

problem Scaling up Schedule-Free Learning to large language models.
method Learning-rate-free and schedule-free method for training large language models.
result ScheduleFree+ outperforms SOTA schedules by 31% at 1000 tokens per parameter.

We derive a new model for pre-strained thin films, which consists of minimizing a biharmonic energy of deformations vW2,2v\in W^{2,2} satisfying the Monge-Ampère constraint det2v=f\det\nabla^2v = f. We further discuss multiplicity properties of the minimizers of this model, in some special cases.

2014-04-12abs ↗pdf ↗

The paper optimizes interpolation schedules in generative models to improve sampling accuracy.

problem Improving sampling accuracy in generative models with fewer resources.
method Minimizing the averaged squared Lipschitzness of the drift field, using transfer formulas.
result Designed schedules yield more accurate fine-scale statistics at fixed integrator budget.

New method converts and optimizes sampling schedules for generative models.

problem Optimizing sampling schedules for generative models like flows and diffusions.
method Unified framework for stochastic interpolants, including point mass schedules.
result Demonstrated efficient generation of images with fewer steps.

The paper presents a multi-power law for predicting loss curves across different learning rate schedules.

problem Understanding and optimizing the relationship between model performance and hyperparameters, especially learning rates.
method Proposes a multi-power law that combines power laws based on the sum of learning rates and additional laws for loss reduction due to decay.
result The multi-power law accurately predicts loss curves for unseen learning rate schedules and finds a schedule that outperforms cosine learning rate.

This paper proposes a system-agnostic policy for dynamic scheduling.

problem Dynamic scheduling in changing systems is challenging due to system-specific optimal policies.
method Descriptive policy that learns a system-agnostic scheduling principle.
result System-agnostic meta-learning enables adaptation to unseen system characteristics.

More and more companies have deployed machine learning (ML) clusters, where deep learning (DL) models are trained for providing various AI-driven services. Efficient resource scheduling is essential for maximal utilization of expensive DL clusters. Existing cluster schedulers either are agnostic to ML workload characte…

2019-09-13abs ↗pdf ↗

Optimal learning rate schedules for SGD in changing data distributions.

problem Minimizing regret in online learning with changing data distributions.
method Characterized optimal schedules for linear regression, proposed schedules for general convex and non-convex losses, and defined a notion of regret for non-convex losses.
result Upper and lower bounds for regret with constants for convex losses, and an upper bound on total expected regret for non-convex losses.

Enhances multi-project scheduling with multiple priority rules.

problem Resource allocation in multi-project scheduling with limited time and resources.
method Simulation-based approach using composite priority rules.
result Increased probability of finding schedules with shortest duration.

Learning-rate schedules for large models match optimization theory closely, leading to better training.

problem Improving training of large models with optimal learning rates.
method Used a bound from non-smooth convex optimization theory to match learning-rate schedules with practical benefits.
result Extending the learning-rate schedule with optimal learning-rate and transferring it across schedules improves model training.

The study introduces anytime learning schedules for large language models without fixed horizons.

problem Training large language models without knowing the total training horizon.
method Theoretical analysis and weight averaging to create anytime learning schedules.
result Theoretical and empirical evidence shows that weight averaging with simple step sizes can achieve comparable final loss to well-tuned cosine schedules.