Research on the Implementation Path of Multi-Objective Optimization Algorithm for English Translation Information Technology Convergence in Big Data
Bibliographic record
Abstract
The big data environment is dynamically changing, so the multi-objective optimization algorithm for the integration of English translation information technology needs to have dynamic adaptability. In this paper, we first construct a multi-objective learning parameter model for English translation information technology. Then a reference point-based environment unpredictable dynamic multi-objective optimization algorithm (UDERP) is proposed to realize the dynamic adaptability of the multi-objective optimization algorithm. Finally, the designed English translation information technology incorporating the UDERP algorithm is simulated and tested. The performance of UDERP algorithm, DNSGA-II algorithm and DSS algorithm are compared with each other using three test functions of FDA series. When the environment changes the optimal solution derived from the algorithm proposed in this paper is closer to the real Pareto solution. Comparing the neural machine translation based on cross-language pre-trained language model and the neural machine translation based on multi-coverage model, the English translation information technology designed in this paper has a better convergence effect and can realize more accurate parameter estimation.
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 distilled prediction
Teacher imitationNot calibrated prevalence, not ground truth. Human validation pending. Learned from the 10,348 direct Codex labels and 10,348 direct Gemma labels. Candidate is the union of thresholded teacher heads; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels or direct frontier model labels.
Codex and Gemma teacher scores by category
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.004 | 0.001 |
| Meta-epidemiology (narrow) | 0.000 | 0.000 |
| Meta-epidemiology (broad) | 0.000 | 0.000 |
| Bibliometrics | 0.001 | 0.001 |
| Science and technology studies | 0.000 | 0.000 |
| Scholarly communication | 0.000 | 0.000 |
| Open science | 0.001 | 0.000 |
| Research integrity | 0.000 | 0.000 |
| Insufficient payload (model declined to judge) | 0.000 | 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 teacher head, 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".