SwePub
Sök i SwePub databas

  Utökad sökning

Träfflista för sökning "WFRF:(Tu Ruibo) "

Sökning: WFRF:(Tu Ruibo)

  • Resultat 1-9 av 9
Sortera/gruppera träfflistan
   
NumreringReferensOmslagsbildHitta
1.
  • Hamesse, Charles, et al. (författare)
  • Simultaneous Measurement Imputation and Outcome Prediction for Achilles Tendon Rupture Rehabilitation
  • 2019
  • Ingår i: Proceedings of Machine Learning Research 106. - : ML Research Press. ; , s. 614-640
  • Konferensbidrag (refereegranskat)abstract
    • Achilles Tendon Rupture (ATR) is one of the typical soft tissue injuries. Rehabilitation after such a musculoskeletal injury remains a prolonged process with a very variable outcome. Accurately predicting rehabilitation outcome is crucial for treatment decision support. However, it is challenging to train an automatic method for predicting the AT Rrehabilitation outcome from treatment data, due to a massive amount of missing entries in the data recorded from ATR patients, as well as complex nonlinear relations between measurements and outcomes. In this work, we design an end-to-end probabilistic framework to impute missing data entries and predict rehabilitation outcomes simultaneously. We evaluate our model on a real-life ATR clinical cohort, comparing with various baselines. The proposed method demonstrates its clear superiority over traditional methods which typically perform imputation and prediction in two separate stages.
  •  
2.
  • Mehta, Shivam, et al. (författare)
  • MATCHA-TTS: A FAST TTS ARCHITECTURE WITH CONDITIONAL FLOW MATCHING
  • 2024
  • Ingår i: 2024 IEEE International Conference on Acoustics, Speech, and Signal Processing, ICASSP 2024 - Proceedings. - : Institute of Electrical and Electronics Engineers (IEEE). ; , s. 11341-11345
  • Konferensbidrag (refereegranskat)abstract
    • We introduce Matcha-TTS, a new encoder-decoder architecture for speedy TTS acoustic modelling, trained using optimal-transport conditional flow matching (OT-CFM). This yields an ODE-based decoder capable of high output quality in fewer synthesis steps than models trained using score matching. Careful design choices additionally ensure each synthesis step is fast to run. The method is probabilistic, non-autoregressive, and learns to speak from scratch without external alignments. Compared to strong pre-trained baseline models, the Matcha-TTS system has the smallest memory footprint, rivals the speed of the fastest model on long utterances, and attains the highest mean opinion score in a listening test.
  •  
3.
  • Tu, Ruibo, 1995- (författare)
  • A Further Step of Causal Discovery towards Real-World Impacts
  • 2023
  • Doktorsavhandling (övrigt vetenskapligt/konstnärligt)abstract
    • The goal of many sciences is to find causal relationships and understand underlying mechanisms. As the golden standard for finding causal relationships, doing randomized experiments can be difficult or impossible in some applications; hence, determining underlying causal relationships purely from observational data, i.e., causal discovery, has attracted more and more attention in many domains, such as earth science, biology, and healthcare. On the one hand, computational methods of causal discovery have been developed and improved significantly in the recent three decades. On the other hand, there are still many challenges in both practice and theory to further achieve real-world impacts. This thesis aims to introduce the typical methods and challenges of causal discovery and then elaborates on the contributions of the included papers that step forward to achieve more real-world impacts for causal discovery. It mainly covers four challenges: practical issues, understanding and generalizing the restrictive assumptions, the lack of benchmark data sets, and applications of causality in machine learning topics. Each included paper contributes to one of the challenges.In the first paper, regarding causal discovery in the presence of missing data as one of the practical issues, we theoretically study the influence of missing values on causal discovery methods and then correct the errors in their results. Under mild assumptions, our proposed method provides asymptotically correct results.In the second paper, we investigate the understanding of assumptions in a class of causal discovery methods. Such methods impose substantial constraints on functional classes and distributions of causal processes for determining causal relationships; however, the constraints are restrictive and there is a lack of good understanding. Therefore, we introduce a new dynamical-system view for understanding the methods and their constraints by connecting optimal transport and causal discovery. Furthermore, we provide a causal discovery criterion and a robust optimal transport-based algorithm. In the third paper, the evaluation of causal discovery methods is discussed. While it is too simplistic to evaluate causal discovery methods on synthetic data generated from random causal graphs, the real-world benchmark data sets with ground-truth causal relations are in great demand and always include practical issues. Thus, we create a neuropathic pain diagnosis simulator based on real-world patient records and domain knowledge. The simulator provides ground-truth causal relations and generates simulation data that cannot be distinguished by the medical expert. Finally, we explored an application of causality: Fairness in machine learning. Many fairness works are based on the constraints of static statistical measures across different demographic groups. It turns out that decisions under such constraints can lead to a pernicious long-term impact on the disadvantaged group. Therefore, we consider the underlying causal processes, theoretically analyze the equilibrium states of dynamical systems under various fairness constraints, show their impact on equilibrium states, and introduce potentially effective interventions to improve the equilibrium states. 
  •  
4.
  • Tu, Ruibo, et al. (författare)
  • Causal Discovery in the Presence of Missing Data
  • 2020
  • Ingår i: 22nd international conference on artificial intelligence and statistics, vol 89. - : Microtome Publishing.
  • Konferensbidrag (refereegranskat)abstract
    • Missing data are ubiquitous in many domains such as healthcare. When these data entries are not missing completely at random, the (conditional) independence relations in the observed data may be different from those in the complete data generated by the underlying causal process. Consequently, simply applying existing causal discovery methods to the observed data may lead to wrong conclusions. In this paper, we aim at developing a causal discovery method to recover the underlying causal structure from observed data that are missing under different mechanisms, including missing completely at random (MCAR), missing at random (MAR), and missing not at random (MNAR). With missingness mechanisms represented by missingness graphs (m-graphs), we analyze conditions under which additional correction is needed to derive conditional independence/dependence relations in the complete data. Based on our analysis, we propose Missing Value PC (MVPC), which extends the PC algorithm to incorporate additional corrections. Our proposed MVPC is shown in theory to give asymptotically correct results even on data that are MAR or MNAR. Experimental results on both synthetic data and real healthcare applications illustrate that the proposed algorithm is able to find correct causal relations even in the general case of MNAR.
  •  
5.
  • Tu, Ruibo, et al. (författare)
  • How Do Fair Decisions Fare in Long-term Qualification?
  • 2020
  • Konferensbidrag (refereegranskat)abstract
    • Although many fairness criteria have been proposed for decision making,  their long-term impact on the well-being of a population remains unclear. In this work, we study the dynamics of population qualification and algorithmic decisions under a partially observed decision making setting. By characterizing the equilibrium of such dynamics, we theoretically analyze the long-term impact of static fairness constraints on the equality and improvement of group well-being. Our results show that static fairness constraints can either promote the equality or exacerbate the disparity depending on the driven factor of qualification transitions and the effect of sensitive attributes on feature distributions. In turn, we consider possible effective interventions that improve group qualification or promote the equality of group qualification. Our theoretical results and experiments on static real-world datasets with simulated dynamics show the consistent findings with social science studies. 
  •  
6.
  • Tu, Ruibo, et al. (författare)
  • Neuropathic Pain Diagnosis Simulator for Causal Discovery Algorithm Evaluation
  • 2019
  • Ingår i: Advances in neural information processing systems 32 (NIPS 2019). - : Neural Information Processing Systems (NIPS).
  • Konferensbidrag (refereegranskat)abstract
    • Discovery of causal relations from observational data is essential for many disciplines of science and real-world applications. However, unlike other machine learning algorithms, whose development has been greatly fostered by a large amount of available benchmark datasets, causal discovery algorithms are notoriously difficult to be systematically evaluated because few datasets with known ground-truth causal relations are available. In this work, we handle the problem of evaluating causal discovery algorithms by building a flexible simulator in the medical setting. We develop a neuropathic pain diagnosis simulator, inspired by the fact that the biological processes of neuropathic pathophysiology are well studied with well-understood causal influences. Our simulator exploits the causal graph of the neuropathic pain pathology and its parameters in the generator are estimated from real-life patient cases. We show that the data generated from our simulator have similar statistics as real-world data. As a clear advantage, the simulator can produce infinite samples without jeopardizing the privacy of real-world patients. Our simulator provides a natural tool for evaluating various types of causal discovery algorithms, including those to deal with practical issues in causal discovery, such as unknown confounders, selection bias, and missing data. Using our simulator, we have evaluated extensively causal discovery algorithms under various settings.
  •  
7.
  • Tu, Ruibo, et al. (författare)
  • Optimal transport for causal discovery
  • 2022
  • Ingår i: ICLR 2022. - : International Conference on Learning Representations, ICLR.
  • Konferensbidrag (refereegranskat)abstract
    • To determine causal relationships between two variables, approaches based on Functional Causal Models (FCMs) have been proposed by properly restricting model classes; however, the performance is sensitive to the model assumptions, which makes it difficult to use. In this paper, we provide a novel dynamical-system view of FCMs and propose a new framework for identifying causal direction in the bivariate case. We first show the connection between FCMs and optimal transport, and then study optimal transport under the constraints of FCMs. Furthermore, by exploiting the dynamical interpretation of optimal transport under the FCM constraints, we determine the corresponding underlying dynamical process of the static cause-effect pair data. It provides a new dimension for describing static causal discovery tasks while enjoying more freedom for modeling the quantitative causal influences. In particular, we show that Additive Noise Models (ANMs) correspond to volume-preserving pressure less flows. Consequently, based on their velocity field divergence, we introduce a criterion for determining causal direction. With this criterion, we propose a novel optimal transport-based algorithm for ANMs which is robust to the choice of models and extend it to post-nonlinear models. Our method demonstrated state-of-the-art results on both synthetic and causal discovery benchmark datasets.
  •  
8.
  • Yin, Wenjie, et al. (författare)
  • Controllable Motion Synthesis and Reconstruction with Autoregressive Diffusion Models
  • 2023
  • Ingår i: 2023 32ND IEEE INTERNATIONAL CONFERENCE ON ROBOT AND HUMAN INTERACTIVE COMMUNICATION, RO-MAN. - : Institute of Electrical and Electronics Engineers (IEEE). ; , s. 1102-1108
  • Konferensbidrag (refereegranskat)abstract
    • Data-driven and controllable human motion synthesis and prediction are active research areas with various applications in interactive media and social robotics. Challenges remain in these fields for generating diverse motions given past observations and dealing with imperfect poses. This paper introduces MoDiff, an autoregressive probabilistic diffusion model over motion sequences conditioned on control contexts of other modalities. Our model integrates a cross-modal Transformer encoder and a Transformer-based decoder, which are found effective in capturing temporal correlations in motion and control modalities. We also introduce a new data dropout method based on the diffusion forward process to provide richer data representations and robust generation. We demonstrate the superior performance of MoDiff in controllable motion synthesis for locomotion with respect to two baselines and show the benefits of diffusion data dropout for robust synthesis and reconstruction of high-fidelity motion close to recorded data.
  •  
9.
  • Zhan, M., et al. (författare)
  • Understanding readers : Conducting sentiment analysis of instagram captions
  • 2018
  • Ingår i: PROCEEDINGS OF 2018 THE 2ND INTERNATIONAL CONFERENCE ON COMPUTER SCIENCE AND ARTIFICIAL INTELLIGENCE (CSAI 2018) / 2018 THE 10TH INTERNATIONAL CONFERENCE ON INFORMATION AND MULTIMEDIA TECHNOLOGY (ICIMT 2018). - New York, NY, USA : Association for Computing Machinery (ACM). - 9781450366069 ; , s. 33-40
  • Konferensbidrag (refereegranskat)abstract
    • The advent of media transition highlights the importance of user-generated content on social media. Amongst the methods of analysis of user-generated content, sentiment analysis is widely used. Nevertheless, few studies use sentiment analysis to investigate user-generated content on Instagram in the context of public libraries. Therefore, this study aims to fill this research gap by conducting sentiment analysis of two million captions on Instagram. Supervised machine learning algorithms were employed to create the classifier. Three opinion polarities and six emotions were ultimately identified via these captions. These polarities provide new insights for understanding readers, thus helping libraries to deliver better services.
  •  
Skapa referenser, mejla, bekava och länka
  • Resultat 1-9 av 9

Kungliga biblioteket hanterar dina personuppgifter i enlighet med EU:s dataskyddsförordning (2018), GDPR. Läs mer om hur det funkar här.
Så här hanterar KB dina uppgifter vid användning av denna tjänst.

 
pil uppåt Stäng

Kopiera och spara länken för att återkomma till aktuell vy