Tropical h-vectors of polytopes
- Series
- Research Horizons Seminar
- Time
- Wednesday, February 13, 2019 - 12:05 for 1 hour (actually 50 minutes)
- Location
- Skiles 006
- Speaker
- Josephine Yu – Georgia Tech
Abstract: In this talk, we consider the Cauchy problem of the N-dimensional incompressible viscoelastic fluids with N ≥ 2. It is shown that, in the low frequency part, this system possesses some dispersive properties derived from the one parameter group e∓itΛ. Based on this dispersive effect, we construct global solutions with large initial velocity concentrating on the low frequency part. Such kind of solution has never been seen before in the literature even for the classical incompressible Navier-Stokes equations. The proof relies heavily on the dispersive estimates for the system of acoustics, and a careful study of the nonlinear terms. And we also obtain the similar result for the isentropic compressible Navier-Stokes equations. Here, the initial velocity with arbitrary B⋅N 2 −1 2,1 norm of potential part P⊥u0 and large highly oscillating are allowed in our results. (Joint works with Daoyuan Fang and Ruizhao Zi)
Abstract: Reiher, Rödl, Ruciński, Schacht, and Szemerédi proved, via a modification of the absorbing method, that every 3-uniform $n$-vertex hypergraph, $n$ large, with minimum vertex degree at least $(5/9+\alpha)n^2/2$ contains a tight Hamiltonian cycle. Recently, owing to a further modification of the method, the same group of authors joined by Bjarne Schuelke, extended this result to 4-uniform hypergraphs with minimum pair degree at least, again, $(5/9+\alpha)n^2/2$. In my talk I will outline these proofs and point to the crucial ideas behind both modifications of the absorbing method.
The popularity of machine learning is increasingly growing in transportation, with applications ranging from traffic engineering to travel demand forecasting and pavement material modeling, to name just a few. Researchers often find that machine learning achieves higher predictive accuracy compared to traditional methods. However, many machine-learning methods are often viewed as “black-box” models, lacking interpretability for decision making. As a result, increased attention is being devoted to the interpretability of machine-learning results.
In this talk, I introduce the application of machine learning to study travel behavior, covering both mode prediction and behavioral interpretation. I first discuss the key differences between machine learning and logit models in modeling travel mode choice, focusing on model development, evaluation, and interpretation. Next, I apply the existing machine-learning interpretation tools and also propose two new model-agnostic interpretation tools to examine behavioral heterogeneity. Lastly, I show the potential of using machine learning as an exploratory tool to tune the utility functions of logit models.
I illustrate these ideas by examining stated-preference travel survey data for a new mobility-on-demand transit system that integrates fixed-route buses and on-demand shuttles. The results show that the best-performing machine-learning classifier results in higher predictive accuracy than logit models as well as comparable behavioral outputs. In addition, results obtained from model-agnostic interpretation tools show that certain machine-learning models (e.g. boosting trees) can readily account for individual heterogeneity and generate valuable behavioral insights on different population segments. Moreover, I show that interpretable machine learning can be applied to tune the utility functions of logit models (e.g. specifying nonlinearities) and to enhance their model performance. In turn, these findings can be used to inform the design of new mobility services and transportation policies.
Please Note: We will go to lunch together after the talk with the graduate students.