The issue of fairness in recommendation is becoming increasingly essential as Recommender Systems (RS) touch and influence more and more people in their daily lives. In fairness-aware recommendation, most of the existing algorithmic approaches mainly aim at solving a constrained optimization problem by imposing a constraint on the level of fairness while optimizing the main recommendation objective, e.g., click through rate (CTR). While this alleviates the impact of unfair recommendations, the expected return of an approach may significantly compromise the recommendation accuracy due to the inherent trade-off between fairness and utility. This motivates us to deal with these conflicting objectives and explore the optimal trade-off between them in recommendation. One conspicuous approach is to seek a Pareto efficient/optimal solution to guarantee optimal compromises between utility and fairness. Moreover, considering the needs of real-world e-commerce platforms, it would be more desirable if we can generalize the whole Pareto Frontier, so that the decision-makers can specify any preference of one objective over another based on their current business needs. Therefore, in this work, we propose a fairness-aware recommendation framework using multi-objective reinforcement learning (MORL), called MoFIR (pronounced "more fair"), which is able to learn a single parametric representation for optimal recommendation policies over the space of all possible preferences. Specially, we modify traditional Deep Deterministic Policy Gradient (DDPG) by introducing conditioned network (CN) into it, which conditions the networks directly on these preferences and outputs Q-value-vectors. Experiments on several real-world recommendation datasets verify the superiority of our framework on both fairness metrics and recommendation measures when compared with all other baselines. We also extract the approximate Pareto Frontier on real-world datasets generated by MoFIR and compare to state-of-the-art fairness methods.

No abstract

No abstract

The fundamental mode confinement loss (CL) of anti-resonant hollow-core fiber (ARF) is efficiently predicted by a classification task of machine learning. The structure–parameter vector is utilized to define the sample space of ARFs. The CL of labeled samples at 1550 nm is numerically calculated via the finite element method (FEM). The magnitude of CL is obtained by a classification task via a decision tree and k -nearest neighbors algorithms with the training and test sets generated by 290700 and 32300 labeled samples. The test accuracy, confusion matrices, and the receiver operating characteristic curves have shown that our proposed method is effective for predicting the magnitude of CL with a short computation runtime compared to FEM simulation. The feasibility of predicting other performance parameters by the extension of our method, as well as its ability to generalize outside the tested sample space, is also discussed. It is likely that the proposed sample definition and the use of a classification approach can be adopted for design application beyond efficient prediction of ARF CL and inspire artificial intelligence and data-driven-based research of photonic structures.

No abstract