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.
Study on scheduling jobs with unknown types, achieving sublinear excess cost.
This paper tackles JSSP with uncertain task durations using DRL.
Study schedules jobs with unknown holding costs to minimize expected cumulative cost.
A heuristic minimizes tardy jobs' total weight on single-machine scheduling.
Study on optimizing task allocation for agents receiving proposals sequentially.
Linking job seekers with relevant jobs requires matching based on not only skills, but also personality types. Although the Holland Code also known as RIASEC has frequently been used to group people by their suitability for six different categories of occupations, the RIASEC category labels of individual jobs are often…
Sequence-to-sequence models predict resource usage for co-scheduled jobs in data centers.
Job recommendation has traditionally been treated as a filter-based match or as a recommendation based on the features of jobs and candidates as discrete entities. In this paper, we introduce a methodology where we leverage the progression of job selection by candidates using machine learning. Additionally, our recomme…
New job recommendation system improves job seekers' welfare through field experiments.
Employing profits data of Japanese companies in 2002 and 2003, we confirm that Pareto's law and the Pareto index are derived from the law of detailed balance and Gibrat's law. The last two laws are observed beyond the region where Pareto's law holds. By classifying companies into job categories, we find that companies …
Microsoft's internal big data analytics platform is comprised of hundreds of thousands of machines, serving over half a million jobs daily, from thousands of users. The majority of these jobs are recurring and are crucial for the company's operation. Although administrators spend significant effort tuning system perfor…
Separating the short jobs from the long is a known technique to improve scheduling performance. In this paper we describe a method we developed for accurately predicting the runtimes classes of the jobs to enable this separation. Our method uses the fact that the runtimes can be represented as a mixture of overlapping …
Algorithm solves job acceptance problem with random arrivals and values.
Paper develops multilingual job classification for ISCO and KZiS.
With the rapid growth of the data volume and the fast increasing of the computational model complexity in the scenario of cloud computing, it becomes an important topic that how to handle users' requests by scheduling computational jobs and assigning the resources in data center. In order to have a better perception of…
Training machine learning (ML) models on large datasets requires considerable computing power. To speed up training, it is typical to distribute training across several machines, often with specialized hardware like GPUs or TPUs. Managing a distributed training job is complex and requires dealing with resource contenti…
The paper proposes an online algorithm for network resource allocation with reduced costs.
Efficiently scheduling data processing jobs on distributed compute clusters requires complex algorithms. Current systems, however, use simple generalized heuristics and ignore workload characteristics, since developing and tuning a scheduling policy for each workload is infeasible. In this paper, we show that modern ma…
We discuss the distribution of commuting distances and its relation to income. Using data from Denmark, the UK, and the US, we show that the commuting distance is (i) broadly distributed with a slow decaying tail that can be fitted by a power law with exponent and (ii) an average growing slowly as a power …
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…
There is a general trend towards solving problems suited to deep learning with more complex deep learning architectures trained on larger training sets. This requires longer compute times and greater data parallelization or model parallelization. Both data and model parallelism have been historically faster in paramete…
Inspired by the unsupervised learning or self-organization in the machine learning context, here we attempt to draw `learning curve' for the collective behavior of job-seeking `zero-intelligence' labors in successive job-hunting processes. Our labor market is supposed to be opened especially for university graduates in…
GraSP-RL uses graph neural networks to improve job shop scheduling.
Market valuation duration is 175 years, but drops to 46 years during crises.
New model predicts financial transaction durations using quantiles.
In this letter we borrow from the inference techniques developed for unbounded state-cardinality (nonparametric) variants of the HMM and use them to develop a tuning-parameter free, black-box inference procedure for Explicit-state-duration hidden Markov models (EDHMM). EDHMMs are HMMs that have latent states consisting…
Job transitions and upskilling are common actions taken by many industry working professionals throughout their career. With the current rapidly changing job landscape where requirements are constantly changing and industry sectors are emerging, it is especially difficult to plan and navigate a predetermined career pat…
In this paper, we present a data-driven model for forecasting the production increase after hydraulic fracturing (HF). We use data from fracturing jobs performed at one of the Siberian oilfields. The data includes features, characterizing the jobs, and geological information. To predict an oil rate after the fracturing…
Paper tackles utility maximization with job-switching and retirement constraints.
New model improves inference on asset market durations.
Algorithm stabilizes queues in asymmetric systems with unknown service rates.
We consider the problem faced by a service platform that needs to match limited supply with demand but also to learn the attributes of new users in order to match them better in the future. We introduce a benchmark model with heterogeneous "workers" (demand) and a limited supply of "jobs" that arrive over time. Job typ…
New econometric results for financial duration models under varying tail behaviors.
Deep RL learns effective job shop scheduling rules from raw features.
Paper presents algorithm for optimal job selection with dynamic scoring.
Unified asymptotic theory and tests for ACD models reveal infinite-mean durations in cryptocurrency trading.
We present our solution to the job recommendation task for RecSys Challenge 2016. The main contribution of our work is to combine temporal learning with sequence modeling to capture complex user-item activity patterns to improve job recommendations. First, we propose a time-based ranking model applied to historical obs…
New conditions for ACD model consistency and normality.
An online labor platform faces an online learning problem in matching workers with jobs and using the performance on these jobs to create better future matches. This learning problem is complicated by the rise of complex tasks on these platforms, such as web development and product design, that require a team of worker…
Statistical models of economic distributions lead to Boltzmann distributions rather than a Pareto power law. This result is supported by two facts: 1. the distributions of income, car sales, marriages or jobs are a matter of chances and luck and not of reason! 2. Data for property, automobile sales, marriages and job m…
The distribution of intertrade durations, defined as the waiting times between two consecutive transactions, is investigated based upon the limit order book data of 23 liquid Chinese stocks listed on the Shenzhen Stock Exchange in the whole year 2003. A scaling pattern is observed in the distributions of intertrade dur…
Study shows training duration impacts model merging quality, suggesting joint selection of duration and method.
A new method uses burst and inter-burst duration to test long-range memory in financial markets.
Study shows training duration affects model merging quality, suggesting joint selection of duration and method.
Proposes a deep hybrid model for better recommendation systems.
Study predicts stock transaction durations using LSTM and attention mechanism.
Proposes a new model for better speech segmentation.
Optimizes resource allocation in a network with random job requests.