A physics-informed learning approach for milling stability analysis with deep subdomain adaptation network
Bibliographic record
Abstract
Efficient and accurate chatter prediction is critical for selection of chatter-free process parameters to improve machining productivity and surface quality of the workpiece. However, challenges arise due to the uncertainty and inaccuracy in model parameters, which may lead to significant differences between predicted and measured stability boundaries. This study introduces a novel physics-informed learning approach for efficiently determining stability in milling based on the deep subdomain adaptation network. First, a deep subdomain adaptation network (DSAN) is developed to extract essential features that characterize the relationship between operating conditions and chatter stability, using both physical models and testing data. Subsequently, we introduce the Local Maximum Mean Discrepancy (LMMD) metric that quantifies the discrepancies in mathematical distribution between features from physical models and testing data, which are generally present and tend to be significant under conditions such as high spindle speeds , heavy cutting forces, or when flexible workpieces are involved. Following this, the LMMD loss is defined and incorporated into the established feedforward network. This loss is calculated and minimized iteratively during the network’s training via backpropagation . We demonstrate that considering those discrepancies in the proposed hybrid-driven modeling enhances prediction accuracies without compromising efficiency. The proposed approach is experimentally validated by extensive milling tests and exhibits greater industrial applicability compared to previous methods.
Fetched live from OpenAlex and de-inverted. Abstracts are not stored in this database: the inverted indexes are 8.6 GB of the frame’s 9.3 GB of text, and the host has 13 GB free.
How this classification was reachedexpand
Full frame machine prediction
Teacher imitationNot calibrated prevalence, not ground truth. Human validation pending. The Gemma side is a direct model label for every work in the frame, read from the title-only record. The Codex side is a classifier learned from the 10,348 direct Codex labels and calibrated to design-weighted sample rates; fields without enough sample support carry no Codex call. Candidate is the union of the two sides; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels.
Distilled classifier scores by category (both heads)
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.000 | 0.001 |
| Meta-epidemiology (narrow) | 0.001 | 0.000 |
| Meta-epidemiology (broad) | 0.000 | 0.000 |
| Bibliometrics | 0.000 | 0.000 |
| Science and technology studies | 0.000 | 0.000 |
| Scholarly communication | 0.000 | 0.001 |
| Open science | 0.001 | 0.001 |
| Research integrity | 0.001 | 0.001 |
| Insufficient payload (model declined to judge) | 0.001 | 0.000 |
Machine scores (provisional)
The two teacher heads of the student model, read on this work. A score orders the frame for review; it never asserts a category, and the validation status ships verbatim with every row.
Baseline scores from an immature model (maturity gate not passed, 7 training rounds). Scores rank; they never assert a category.
score_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from itClassification
machine, unvalidatedMachine predicted; a candidate call from one source (direct Gemma or distilled Codex), not a consensus.
How this classification was reached, model by model and score by score, is at the end of the page under "How this classification was reached".