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…
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,695 papers · 148 categories
Trend · papers per month
48 results for “job training program”
Paper develops methods to estimate derivative of dose-response curve for continuous treatments.
problem Estimating the derivative of the dose-response curve for continuous treatments.
method Doubly robust (DR) inference method using kernel smoothing, bias-corrected IPW and DR estimators.
result Proposes novel bias-corrected IPW and DR estimators for continuous treatments.
The paper tackles long-term treatment effects with persistent confounders using sequential short-term outcomes.
problem Estimating long-term treatment effects with persistent unmeasured confounders.
method Exploiting the sequential structure of short-term outcomes, the paper develops three novel identification strategies and corresponding estimators.
result The proposed methods outperform existing approaches in handling persistent confounders.
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…
In this paper we present the Warm-starting Dynamic Thresholding algorithm, developed using dynamic programming, for a variant of the standard online selection problem. The problem allows job positions to be either free or already occupied at the beginning of the process. Throughout the selection process, the decision m…
Big data, data science, deep learning, artificial intelligence are the key words of intense hype related with a job market in full evolution, that impose to adapt the contents of our university professional trainings. Which artificial intelligence is mostly concerned by the job offers? Which methodologies and technolog…
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…
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 …
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…
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…
Graph neural networks-based Scheduler for Production planning problems using Reinforcement Learningcs.LG
GraSP-RL uses graph neural networks to improve job shop scheduling.
problem Capturing machine-unit-job sequence relationships and managing state space growth.
method Graph neural networks for feature extraction, reinforcement learning for decision-making, decentralized optimization.
result GraSP-RL outperforms existing methods in minimizing makespan for complex production environments.
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…
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…
The paper uses double machine learning to estimate dynamic treatment effects robustly.
problem Estimating causal effects of dynamic treatments with time-varying covariates.
method Double machine learning with Neyman-orthogonal score functions for robustness.
result Asymptotic normality and -consistency of the estimators under specific conditions.
New kernel methods estimate complex causal relationships.
problem Estimating nonparametric causal functions like dose-response curves.
method Kernel ridge regression with decomposition property.
result Uniform consistency with finite sample rates proved.
Study schedules jobs with unknown holding costs to minimize expected cumulative cost.
problem Minimizing expected cumulative holding costs of jobs with unknown parameters.
method Learning-based rule scheduling with a preemption phase.
result Achieves near-optimal performance guarantees with nearly matching regret bounds.
Deep RL learns effective job shop scheduling rules from raw features.
problem Designing effective priority dispatching rules for job shop scheduling is challenging.
method End-to-end deep reinforcement learning using Graph Neural Networks.
result Agent learns high-quality dispatching rules from raw features and generalizes well to unseen instances.
Study on scheduling jobs with unknown types, achieving sublinear excess cost.
problem Optimizing job scheduling with unknown job types and varying durations.
method Design of algorithms for non-preemptive and preemptive scenarios, proving lower bounds.
result Preemptive algorithms can significantly outperform non-preemptive ones when job types have distinct durations.
Sequence-to-sequence models predict resource usage for co-scheduled jobs in data centers.
problem Challenges in co-scheduling jobs due to resource interference and inefficiencies.
method Sequence-to-sequence models based on recurrent neural networks for workload interference prediction.
result Models accurately forecast resource usage trends from job profiles, improving scheduling decisions.
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.
problem Current job recommendation systems focus on clicks and applications, not job seekers' welfare.
method Developed a job-search model with two dimensions: utility and success probability. Conducted field experiments to validate model predictions.
result Welfare-optimal job recommendation algorithms outperform existing approaches and perform close to the benchmark.
On the implementation of the Universal Basic Income as a response to technological unemploymentecon.GN
The paper critiques UBI as ineffective for addressing technological unemployment.
problem Technological unemployment due to automation.
method Empirical data analysis and theoretical projections of UBI's impact.
result UBI is not an effective solution for improving living standards and employability among displaced workers.
Paper uses RL to solve constrained combinatorial optimization problems.
problem Constrained combinatorial optimization problems.
method Extending NCO theory to CMDPs, using RL with penalty signals.
result Proposes a superior method for solving constrained problems.
Pareto index induced from the scale of companiesphysics.soc-ph
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 …
Algorithm solves job acceptance problem with random arrivals and values.
problem Decision-making under random job arrivals and values with limited acceptance.
method Proposes Non-Parametric Sequential Allocation (NPSA) algorithm.
result Expected reward converges to optimality as sample size increases.
Paper develops multilingual job classification for ISCO and KZiS.
problem Classifying job advertisements for accurate occupation coding.
method Transformer architecture for hierarchical multi-class classification.
result Hierarchical structure improves prediction accuracy by 1-2 percentage points.
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…
Develops methods to identify and estimate causal effects with instrumental variables.
problem Causal inference with confounded treatment assignment and unobserved variables.
method General nonparametric causal framework, debiased machine learning, semiparametric theory.
result Consistent and asymptotically normal estimators for average treatment effect.
Machine learning models learn what we teach them to learn. Machine learning is at the heart of recommender systems. If a machine learning model is trained on biased data, the resulting recommender system may reflect the biases in its recommendations. Biases arise at different stages in a recommender system, from existi…
The paper proposes an online algorithm for network resource allocation with reduced costs.
problem Optimizing resource allocation and job transfers in a network of servers.
method Randomized online algorithm based on the exponentially weighted method.
result The algorithm achieves sub-linear regret, indicating improved efficiency over time.
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 …
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…
Personalized interventions in social services, education, and healthcare leverage individual-level causal effect predictions in order to give the best treatment to each individual or to prioritize program interventions for the individuals most likely to benefit. While the sensitivity of these domains compels us to eval…
Search-based methods for hard combinatorial optimization are often guided by heuristics. Tuning heuristics in various conditions and situations is often time-consuming. In this paper, we propose NeuRewriter that learns a policy to pick heuristics and rewrite the local components of the current solution to iteratively i…
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…
A Problem of Finite-Horizon Optimal Switching and Stochastic Control for Utility Maximizationmath.OC
Paper tackles utility maximization with job-switching and retirement constraints.
problem Maximizing utility with job-switching and retirement constraints.
method Dual-martingale approach and double obstacle problem theory.
result Characterization of optimal job-switching strategy and wealth boundaries.
Algorithm stabilizes queues in asymmetric systems with unknown service rates.
problem Stabilizing queues in multi-class multi-server systems with unknown service rates.
method Proposes UCB and Thompson Sampling algorithms to stabilize queues while learning service rates.
result Achieves system stability with an average queue length bound of \(O(\min\{N,K\}/ε)\) for large time horizon \(T\).
Minimizing the Weighted Number of Tardy Jobs: Data-Driven Heuristic for Single-Machine Schedulingcs.LG
A heuristic minimizes tardy jobs' total weight on single-machine scheduling.
problem Minimizing tardy jobs' total weight on single-machine scheduling.
method Data-driven heuristic combining machine learning and problem-specific characteristics.
result Significantly outperforms state-of-the-art in optimality gap and adaptability.
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…
We present a lightweight Python framework for distributed training of neural networks on multiple GPUs or CPUs. The framework is built on the popular Keras machine learning library. The Message Passing Interface (MPI) protocol is used to coordinate the training process, and the system is well suited for job submission …
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…
Multimodal analysis assesses job interview performance and provides feedback.
problem Assessing candidate performance in interviews for professional roles.
method Multimodal analytical framework using video, audio, and text data.
result The proposed methodology achieved promising results in predicting behavioral cues.
We consider the problem of ESO valuation in continuous time. In particular, we consider models that assume that an appropriate random time serves as a proxy for anything that causes the ESO's holder to exercise the option early, namely, reflects the ESO holder's job termination risk as well as early exercise behaviour.…
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…
Measurements made by satellite remote sensing, Moderate Resolution Imaging Spectroradiometer (MODIS), and globally distributed Aerosol Robotic Network (AERONET) are compared. Comparison of the two datasets measurements for aerosol optical depth values show that there are biases between the two data products. In this pa…
Proposes a deep hybrid model for better recommendation systems.
problem Limited studies on hybrid recommender systems and the need for more advanced approaches.
method Integrates deep learning with ID embeddings and auxiliary features for improved recommendation.
result Improves recommendation results over deep learning models using ID embeddings.
Optimizes resource allocation in a network with random job requests.
problem Minimizing costs while satisfying job requests within a budget.
method Formalizes as a repeated game, proposes an online saddle-point algorithm.
result Upper bounds for regret and constraint violations are derived.